./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:10:46,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:10:46,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:10:46,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:10:46,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:10:46,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:10:46,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:10:46,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:10:46,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:10:46,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:10:46,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:10:46,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:10:46,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:10:46,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:10:46,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:10:46,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:10:46,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:10:46,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:10:46,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:10:46,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:10:46,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:10:46,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:10:46,577 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:10:46,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:10:46,577 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:10:46,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:10:46,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:10:46,578 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:10:46,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:10:46,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:10:46,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:10:46,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:10:46,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:10:46,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:10:46,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:10:46,579 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:10:46,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:10:46,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:10:46,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:10:46,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:10:46,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:10:46,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:10:46,582 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 [2024-11-12 01:10:46,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:10:46,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:10:46,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:10:46,780 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:10:46,780 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:10:46,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i [2024-11-12 01:10:47,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:10:48,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:10:48,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i [2024-11-12 01:10:48,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4645c54/1c90454eea904da19df9c3e7f695f8d3/FLAGe48790f79 [2024-11-12 01:10:48,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4645c54/1c90454eea904da19df9c3e7f695f8d3 [2024-11-12 01:10:48,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:10:48,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:10:48,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:10:48,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:10:48,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:10:48,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eafc4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48, skipping insertion in model container [2024-11-12 01:10:48,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:10:48,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i[913,926] [2024-11-12 01:10:48,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:10:48,418 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:10:48,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i[913,926] [2024-11-12 01:10:48,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:10:48,462 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:10:48,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48 WrapperNode [2024-11-12 01:10:48,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:10:48,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:10:48,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:10:48,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:10:48,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,502 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-11-12 01:10:48,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:10:48,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:10:48,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:10:48,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:10:48,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,529 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:10:48,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:10:48,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:10:48,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:10:48,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:10:48,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (1/1) ... [2024-11-12 01:10:48,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:10:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:10:48,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:10:48,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:10:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:10:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:10:48,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:10:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:10:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:10:48,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:10:48,669 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:10:48,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:10:48,915 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:10:48,915 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:10:48,925 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:10:48,926 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:10:48,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:48 BoogieIcfgContainer [2024-11-12 01:10:48,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:10:48,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:10:48,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:10:48,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:10:48,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:10:48" (1/3) ... [2024-11-12 01:10:48,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a115c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:10:48, skipping insertion in model container [2024-11-12 01:10:48,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:10:48" (2/3) ... [2024-11-12 01:10:48,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a115c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:10:48, skipping insertion in model container [2024-11-12 01:10:48,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:48" (3/3) ... [2024-11-12 01:10:48,935 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-11.i [2024-11-12 01:10:48,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:10:48,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:10:49,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:10:49,012 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@557b7612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:10:49,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:10:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:10:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 01:10:49,025 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:10:49,026 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:10:49,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:10:49,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:10:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 468983379, now seen corresponding path program 1 times [2024-11-12 01:10:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:10:49,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263567306] [2024-11-12 01:10:49,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:10:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:10:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:10:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:10:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:10:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:10:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:10:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:10:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:10:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:10:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:10:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:10:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:10:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:10:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:10:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:10:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:10:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:10:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:10:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:10:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:10:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:10:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:10:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:10:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:10:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 01:10:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:10:49,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263567306] [2024-11-12 01:10:49,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263567306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:10:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:10:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:10:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321990950] [2024-11-12 01:10:49,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:10:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:10:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:10:49,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:10:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:10:49,505 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:10:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:10:49,529 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-11-12 01:10:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:10:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2024-11-12 01:10:49,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:10:49,539 INFO L225 Difference]: With dead ends: 127 [2024-11-12 01:10:49,539 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 01:10:49,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:10:49,547 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:10:49,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:10:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 01:10:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-12 01:10:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:10:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-12 01:10:49,586 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2024-11-12 01:10:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:10:49,587 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-12 01:10:49,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:10:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-12 01:10:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 01:10:49,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:10:49,591 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:10:49,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:10:49,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:10:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:10:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1934924889, now seen corresponding path program 1 times [2024-11-12 01:10:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:10:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558862971] [2024-11-12 01:10:49,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:10:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:10:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:10:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:10:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:10:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:10:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:10:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:10:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:10:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:10:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:10:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:10:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:10:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:10:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:10:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:10:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:10:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:10:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:10:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:10:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:10:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:51,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:10:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:10:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:10:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:10:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 81 proven. 45 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-12 01:10:52,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:10:52,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558862971] [2024-11-12 01:10:52,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558862971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:10:52,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10203294] [2024-11-12 01:10:52,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:10:52,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:10:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:10:52,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:10:52,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:10:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:52,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 01:10:52,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:10:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 740 proven. 108 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-12 01:10:53,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:10:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10203294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:10:54,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:10:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 26 [2024-11-12 01:10:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549934193] [2024-11-12 01:10:54,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:10:54,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 01:10:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:10:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 01:10:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2024-11-12 01:10:54,714 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 26 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 11 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-12 01:10:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:10:58,830 INFO L93 Difference]: Finished difference Result 259 states and 347 transitions. [2024-11-12 01:10:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-12 01:10:58,832 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 11 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 144 [2024-11-12 01:10:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:10:58,835 INFO L225 Difference]: With dead ends: 259 [2024-11-12 01:10:58,835 INFO L226 Difference]: Without dead ends: 199 [2024-11-12 01:10:58,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2225 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2162, Invalid=6394, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 01:10:58,839 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 449 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 01:10:58,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 570 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 01:10:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-12 01:10:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2024-11-12 01:10:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 119 states have internal predecessors, (139), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-12 01:10:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2024-11-12 01:10:58,881 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 144 [2024-11-12 01:10:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:10:58,882 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2024-11-12 01:10:58,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 11 states have call successors, (42), 6 states have call predecessors, (42), 9 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-12 01:10:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2024-11-12 01:10:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 01:10:58,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:10:58,884 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:10:58,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:10:59,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:10:59,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:10:59,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:10:59,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1658977829, now seen corresponding path program 1 times [2024-11-12 01:10:59,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:10:59,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906788026] [2024-11-12 01:10:59,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:10:59,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:10:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:10:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:10:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:10:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:10:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:10:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:10:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:10:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:10:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:10:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:10:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:10:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:10:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:10:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:10:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:10:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:10:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:10:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:10:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:10:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:10:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:10:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:10:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:10:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 01:10:59,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:10:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906788026] [2024-11-12 01:10:59,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906788026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:10:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337961658] [2024-11-12 01:10:59,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:10:59,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:10:59,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:10:59,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:10:59,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 01:10:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:10:59,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 01:10:59,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:11:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 758 proven. 108 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-12 01:11:01,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:11:01,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337961658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:11:01,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:11:01,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 25 [2024-11-12 01:11:01,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289826469] [2024-11-12 01:11:01,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:11:01,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 01:11:01,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:11:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 01:11:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 01:11:01,933 INFO L87 Difference]: Start difference. First operand 187 states and 243 transitions. Second operand has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-12 01:11:03,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:03,472 INFO L93 Difference]: Finished difference Result 438 states and 552 transitions. [2024-11-12 01:11:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-12 01:11:03,474 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) Word has length 144 [2024-11-12 01:11:03,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:03,476 INFO L225 Difference]: With dead ends: 438 [2024-11-12 01:11:03,476 INFO L226 Difference]: Without dead ends: 264 [2024-11-12 01:11:03,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1450, Invalid=3662, Unknown=0, NotChecked=0, Total=5112 [2024-11-12 01:11:03,483 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 203 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:03,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 460 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 01:11:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-12 01:11:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 112. [2024-11-12 01:11:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 70 states have (on average 1.1428571428571428) internal successors, (80), 71 states have internal predecessors, (80), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 01:11:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions. [2024-11-12 01:11:03,518 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 142 transitions. Word has length 144 [2024-11-12 01:11:03,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:03,519 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 142 transitions. [2024-11-12 01:11:03,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0833333333333335) internal successors, (74), 22 states have internal predecessors, (74), 11 states have call successors, (42), 7 states have call predecessors, (42), 10 states have return successors, (42), 11 states have call predecessors, (42), 11 states have call successors, (42) [2024-11-12 01:11:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2024-11-12 01:11:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 01:11:03,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:03,521 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:03,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 01:11:03,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 01:11:03,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -312771240, now seen corresponding path program 1 times [2024-11-12 01:11:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:11:03,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096129793] [2024-11-12 01:11:03,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:03,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:11:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:11:03,795 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:11:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:11:03,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:11:03,882 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:11:03,883 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:11:03,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:11:03,888 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 01:11:03,967 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:11:03,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:11:03 BoogieIcfgContainer [2024-11-12 01:11:03,969 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:11:03,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:11:03,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:11:03,970 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:11:03,970 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:10:48" (3/4) ... [2024-11-12 01:11:03,976 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:11:03,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:11:03,977 INFO L158 Benchmark]: Toolchain (without parser) took 15789.19ms. Allocated memory was 186.6MB in the beginning and 434.1MB in the end (delta: 247.5MB). Free memory was 158.2MB in the beginning and 338.2MB in the end (delta: -180.0MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2024-11-12 01:11:03,977 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:11:03,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.80ms. Allocated memory is still 186.6MB. Free memory was 157.4MB in the beginning and 142.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 01:11:03,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.04ms. Allocated memory is still 186.6MB. Free memory was 142.9MB in the beginning and 140.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:11:03,978 INFO L158 Benchmark]: Boogie Preprocessor took 34.15ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 137.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:11:03,978 INFO L158 Benchmark]: RCFGBuilder took 385.15ms. Allocated memory is still 186.6MB. Free memory was 137.3MB in the beginning and 119.2MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 01:11:03,978 INFO L158 Benchmark]: TraceAbstraction took 15039.61ms. Allocated memory was 186.6MB in the beginning and 434.1MB in the end (delta: 247.5MB). Free memory was 118.4MB in the beginning and 339.3MB in the end (delta: -220.9MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-12 01:11:03,979 INFO L158 Benchmark]: Witness Printer took 7.02ms. Allocated memory is still 434.1MB. Free memory was 339.3MB in the beginning and 338.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:11:03,980 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.80ms. Allocated memory is still 186.6MB. Free memory was 157.4MB in the beginning and 142.9MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.04ms. Allocated memory is still 186.6MB. Free memory was 142.9MB in the beginning and 140.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.15ms. Allocated memory is still 186.6MB. Free memory was 140.2MB in the beginning and 137.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 385.15ms. Allocated memory is still 186.6MB. Free memory was 137.3MB in the beginning and 119.2MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15039.61ms. Allocated memory was 186.6MB in the beginning and 434.1MB in the end (delta: 247.5MB). Free memory was 118.4MB in the beginning and 339.3MB in the end (delta: -220.9MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * Witness Printer took 7.02ms. Allocated memory is still 434.1MB. Free memory was 339.3MB in the beginning and 338.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someUnaryDOUBLEoperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 4; [L28] signed char var_1_7 = 0; [L29] signed char var_1_8 = 16; [L30] signed char var_1_9 = 4; [L31] unsigned long int var_1_10 = 128; [L32] unsigned long int var_1_11 = 1422462314; [L33] signed short int var_1_12 = 8; [L34] float var_1_13 = 49.5; [L35] float var_1_14 = 0.4; [L36] signed short int var_1_15 = -50; [L37] unsigned long int var_1_16 = 1; [L38] unsigned long int var_1_17 = 3609236770; [L39] unsigned long int var_1_18 = 2902762324; [L40] double var_1_19 = 3.8; [L41] double var_1_20 = 255.75; [L42] unsigned short int var_1_21 = 0; VAL [isInitial=0, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] FCALL updateLastVariables() [L134] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L88] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L89] var_1_3 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L91] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=-256, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L92] var_1_5 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L93] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L94] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=4, var_1_7=0, var_1_8=16, var_1_9=4] [L95] var_1_6 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_6 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=0, var_1_8=16, var_1_9=4] [L96] RET assume_abort_if_not(var_1_6 >= -32768) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=0, var_1_8=16, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=0, var_1_8=16, var_1_9=4] [L97] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=0, var_1_8=16, var_1_9=4] [L98] var_1_7 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=16, var_1_9=4] [L99] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=16, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=16, var_1_9=4] [L100] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=16, var_1_9=4] [L101] var_1_8 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=4] [L102] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=4] [L103] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=4] [L104] var_1_9 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L105] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L106] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L106] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L107] var_1_11 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L108] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L109] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L109] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_13=99/2, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L110] var_1_13 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L111] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_14=2/5, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L112] var_1_14 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L113] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L114] var_1_17 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L115] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L116] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L116] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L117] var_1_18 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L118] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L119] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L119] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L120] var_1_20 = __VERIFIER_nondet_double() [L121] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L121] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L134] RET updateVariables() [L135] CALL step() [L46] var_1_1 = (var_1_2 || (! var_1_3)) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=5, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L47] COND TRUE var_1_5 == var_1_6 [L48] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, var_1_10=128, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L50] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L51] COND TRUE var_1_6 != var_1_10 VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L52] COND FALSE !(var_1_8 <= var_1_6) VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L60] COND FALSE !(\read(var_1_2)) [L69] var_1_15 = 5 VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=5, var_1_16=1, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L71] COND TRUE var_1_13 != var_1_14 [L72] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L80] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L81] COND FALSE !((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L135] RET step() [L136] CALL, EXPR property() [L126-L127] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_5 == var_1_6) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((var_1_6 != var_1_10) ? ((var_1_8 <= var_1_6) ? (((- var_1_13) >= var_1_14) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_2 ? ((var_1_13 >= var_1_14) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_13 != var_1_14) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_5 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_12 == (var_1_8 - var_1_9)) && var_1_2) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] [L19] reach_error() VAL [isInitial=1, var_1_10=7248252344, var_1_11=-3221225473, var_1_12=8, var_1_15=5, var_1_16=125, var_1_17=-4294967298, var_1_18=-6442450945, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=9, var_1_6=9, var_1_7=62, var_1_8=63, var_1_9=67] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 660 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 652 mSDsluCounter, 1125 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 826 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1832 IncrementalHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 299 mSDtfsCounter, 1832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 768 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=2, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 164 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 7572 SizeOfPredicates, 10 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4778/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 01:11:04,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:11:05,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:11:05,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:11:05,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:11:05,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:11:05,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:11:05,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:11:05,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:11:05,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:11:05,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:11:05,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:11:05,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:11:05,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:11:05,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:11:05,927 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:11:05,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:11:05,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:11:05,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:11:05,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:11:05,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:11:05,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:11:05,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:11:05,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:11:05,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:11:05,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:11:05,929 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:11:05,929 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:11:05,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:11:05,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:11:05,930 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:11:05,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:11:05,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:11:05,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:11:05,930 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:11:05,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:11:05,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:11:05,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:11:05,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:11:05,931 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:11:05,931 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:11:05,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:11:05,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:11:05,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:11:05,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:11:05,935 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb4a5dbd9bd36a08553228e3579f9c0fa33ebcb9ef473081910f145eb5cf5929 [2024-11-12 01:11:06,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:11:06,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:11:06,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:11:06,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:11:06,238 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:11:06,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i [2024-11-12 01:11:07,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:11:07,707 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:11:07,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i [2024-11-12 01:11:07,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9005b58d9/959ca1dcf5604c6f874a2e581dcbd57f/FLAG48b0773e9 [2024-11-12 01:11:08,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9005b58d9/959ca1dcf5604c6f874a2e581dcbd57f [2024-11-12 01:11:08,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:11:08,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:11:08,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:11:08,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:11:08,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:11:08,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d2e1e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08, skipping insertion in model container [2024-11-12 01:11:08,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:11:08,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i[913,926] [2024-11-12 01:11:08,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:11:08,330 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:11:08,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-11.i[913,926] [2024-11-12 01:11:08,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:11:08,387 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:11:08,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08 WrapperNode [2024-11-12 01:11:08,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:11:08,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:11:08,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:11:08,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:11:08,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,441 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-12 01:11:08,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:11:08,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:11:08,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:11:08,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:11:08,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,478 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:11:08,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:11:08,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:11:08,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:11:08,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:11:08,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (1/1) ... [2024-11-12 01:11:08,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:11:08,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:11:08,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:11:08,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:11:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:11:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:11:08,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:11:08,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:11:08,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:11:08,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:11:08,671 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:11:08,673 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:11:08,944 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:11:08,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:11:08,957 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:11:08,958 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:11:08,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:11:08 BoogieIcfgContainer [2024-11-12 01:11:08,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:11:08,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:11:08,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:11:08,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:11:08,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:11:08" (1/3) ... [2024-11-12 01:11:08,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128c67f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:11:08, skipping insertion in model container [2024-11-12 01:11:08,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:11:08" (2/3) ... [2024-11-12 01:11:08,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128c67f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:11:08, skipping insertion in model container [2024-11-12 01:11:08,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:11:08" (3/3) ... [2024-11-12 01:11:08,965 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-11.i [2024-11-12 01:11:08,976 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:11:08,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:11:09,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:11:09,032 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23975266, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:11:09,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:11:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:11:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 01:11:09,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:09,047 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:09,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:09,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash 468983379, now seen corresponding path program 1 times [2024-11-12 01:11:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:11:09,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360282353] [2024-11-12 01:11:09,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:09,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:11:09,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:11:09,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:11:09,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 01:11:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:09,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:11:09,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:11:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-12 01:11:09,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:11:09,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:11:09,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360282353] [2024-11-12 01:11:09,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360282353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:11:09,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:11:09,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:11:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387992503] [2024-11-12 01:11:09,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:11:09,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:11:09,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:11:09,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:11:09,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:11:09,334 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:11:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:11:09,360 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2024-11-12 01:11:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:11:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2024-11-12 01:11:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:11:09,371 INFO L225 Difference]: With dead ends: 127 [2024-11-12 01:11:09,371 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 01:11:09,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:11:09,377 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:11:09,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:11:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 01:11:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-12 01:11:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 01:11:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-12 01:11:09,419 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 144 [2024-11-12 01:11:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:11:09,420 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-12 01:11:09,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 01:11:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-12 01:11:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 01:11:09,423 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:11:09,423 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:11:09,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:11:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:11:09,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:11:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:11:09,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1934924889, now seen corresponding path program 1 times [2024-11-12 01:11:09,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:11:09,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949288043] [2024-11-12 01:11:09,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:11:09,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:11:09,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:11:09,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:11:09,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:11:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:11:09,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 01:11:09,796 INFO L279 TraceCheckSpWp]: Computing forward predicates...