./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-96.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bc4343435e8b0f90e9fafca790203e82878241d49cdad6f8cc3fc03787f7fe2b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:01:35,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:01:35,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:01:35,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:01:35,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:01:35,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:01:35,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:01:35,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:01:35,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:01:35,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:01:35,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:01:35,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:01:35,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:01:35,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:01:35,429 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:01:35,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:01:35,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:01:35,430 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:01:35,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:01:35,431 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:01:35,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:01:35,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:01:35,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:01:35,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:01:35,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:01:35,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:01:35,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:01:35,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:01:35,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:01:35,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:01:35,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:01:35,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:01:35,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:01:35,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:01:35,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:01:35,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:01:35,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:01:35,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:01:35,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:01:35,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:01:35,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:01:35,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:01:35,456 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-clean/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-clean/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 -> bc4343435e8b0f90e9fafca790203e82878241d49cdad6f8cc3fc03787f7fe2b [2024-10-11 13:01:35,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:01:35,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:01:35,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:01:35,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:01:35,751 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:01:35,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-96.i [2024-10-11 13:01:37,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:01:37,465 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:01:37,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-96.i [2024-10-11 13:01:37,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d99e3b5c/a856d0c8b12040e7829a1a87333ceee8/FLAG985e4eb37 [2024-10-11 13:01:37,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d99e3b5c/a856d0c8b12040e7829a1a87333ceee8 [2024-10-11 13:01:37,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:01:37,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:01:37,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:01:37,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:01:37,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:01:37,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:37,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea0e47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37, skipping insertion in model container [2024-10-11 13:01:37,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:37,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:01:37,712 WARN L248 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_operatoramount_amount50_file-96.i[915,928] [2024-10-11 13:01:37,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:01:37,819 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:01:37,833 WARN L248 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_operatoramount_amount50_file-96.i[915,928] [2024-10-11 13:01:37,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:01:37,904 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:01:37,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37 WrapperNode [2024-10-11 13:01:37,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:01:37,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:01:37,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:01:37,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:01:37,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:37,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:37,968 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-10-11 13:01:37,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:01:37,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:01:37,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:01:37,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:01:37,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:37,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:37,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,013 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-10-11 13:01:38,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:01:38,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:01:38,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:01:38,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:01:38,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (1/1) ... [2024-10-11 13:01:38,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:01:38,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:01:38,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:01:38,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:01:38,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:01:38,135 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:01:38,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:01:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:01:38,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:01:38,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:01:38,223 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:01:38,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:01:38,535 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 13:01:38,535 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:01:38,587 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:01:38,587 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:01:38,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:01:38 BoogieIcfgContainer [2024-10-11 13:01:38,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:01:38,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:01:38,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:01:38,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:01:38,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:01:37" (1/3) ... [2024-10-11 13:01:38,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704af463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:01:38, skipping insertion in model container [2024-10-11 13:01:38,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:37" (2/3) ... [2024-10-11 13:01:38,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704af463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:01:38, skipping insertion in model container [2024-10-11 13:01:38,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:01:38" (3/3) ... [2024-10-11 13:01:38,599 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-96.i [2024-10-11 13:01:38,615 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:01:38,616 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:01:38,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:01:38,684 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;@6555fe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:01:38,684 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:01:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:01:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:01:38,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:38,705 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:01:38,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:38,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash -715942634, now seen corresponding path program 1 times [2024-10-11 13:01:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:01:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115647351] [2024-10-11 13:01:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:01:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:01:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:01:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:01:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:01:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:01:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:01:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:01:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:01:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:01:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:01:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:01:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:01:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:01:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:01:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:01:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:01:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:01:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:01:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:01:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:01:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:01:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:01:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:01:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:01:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:01:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:01:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:01:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 13:01:39,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:01:39,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115647351] [2024-10-11 13:01:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115647351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:01:39,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:01:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:01:39,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575482169] [2024-10-11 13:01:39,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:01:39,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:01:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:01:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:01:39,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:01:39,401 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 13:01:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:01:39,451 INFO L93 Difference]: Finished difference Result 128 states and 229 transitions. [2024-10-11 13:01:39,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:01:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 163 [2024-10-11 13:01:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:01:39,465 INFO L225 Difference]: With dead ends: 128 [2024-10-11 13:01:39,466 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 13:01:39,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-10-11 13:01:39,475 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:01:39,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:01:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 13:01:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 13:01:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:01:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2024-10-11 13:01:39,527 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 163 [2024-10-11 13:01:39,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:01:39,529 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2024-10-11 13:01:39,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 13:01:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2024-10-11 13:01:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:01:39,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:39,536 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:01:39,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:01:39,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:39,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -358824420, now seen corresponding path program 1 times [2024-10-11 13:01:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:01:39,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981818512] [2024-10-11 13:01:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:01:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:01:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:01:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:01:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:01:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:01:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:01:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:01:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:01:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:01:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:01:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:01:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:01:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:01:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:01:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:01:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:01:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:01:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:01:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:01:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:01:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:01:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:01:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:01:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:01:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:01:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:01:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:01:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 13:01:40,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:01:40,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981818512] [2024-10-11 13:01:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981818512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:01:40,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:01:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:01:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67176902] [2024-10-11 13:01:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:01:40,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:01:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:01:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:01:40,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:01:40,228 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 13:01:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:01:40,462 INFO L93 Difference]: Finished difference Result 185 states and 278 transitions. [2024-10-11 13:01:40,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:01:40,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 163 [2024-10-11 13:01:40,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:01:40,467 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:01:40,468 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 13:01:40,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:01:40,471 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 48 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:01:40,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 262 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:01:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 13:01:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2024-10-11 13:01:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:01:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2024-10-11 13:01:40,510 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 163 [2024-10-11 13:01:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:01:40,511 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2024-10-11 13:01:40,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 13:01:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2024-10-11 13:01:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:01:40,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:40,516 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:01:40,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:01:40,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:40,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:40,518 INFO L85 PathProgramCache]: Analyzing trace with hash 342240158, now seen corresponding path program 1 times [2024-10-11 13:01:40,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:01:40,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940066845] [2024-10-11 13:01:40,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:01:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:01:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:01:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:01:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:01:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:01:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:01:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:01:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:01:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:01:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 13:01:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 13:01:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:01:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:01:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 13:01:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 13:01:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 13:01:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 13:01:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:01:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:01:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 13:01:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 13:01:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 13:01:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 13:01:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:01:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:01:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:01:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:01:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 30 proven. 48 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-11 13:01:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:01:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940066845] [2024-10-11 13:01:41,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940066845] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:01:41,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374247620] [2024-10-11 13:01:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:41,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:01:41,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:01:41,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:01:41,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:01:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:41,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 13:01:41,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:01:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 944 proven. 120 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-11 13:01:42,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:01:42,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 69 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-10-11 13:01:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374247620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:01:42,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:01:42,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 10] total 25 [2024-10-11 13:01:42,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381342127] [2024-10-11 13:01:42,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:01:42,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 13:01:42,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:01:42,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 13:01:42,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:01:42,741 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 23 states have internal predecessors, (91), 9 states have call successors, (59), 5 states have call predecessors, (59), 9 states have return successors, (60), 9 states have call predecessors, (60), 9 states have call successors, (60) [2024-10-11 13:01:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:01:44,167 INFO L93 Difference]: Finished difference Result 304 states and 407 transitions. [2024-10-11 13:01:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 13:01:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 23 states have internal predecessors, (91), 9 states have call successors, (59), 5 states have call predecessors, (59), 9 states have return successors, (60), 9 states have call predecessors, (60), 9 states have call successors, (60) Word has length 163 [2024-10-11 13:01:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:01:44,172 INFO L225 Difference]: With dead ends: 304 [2024-10-11 13:01:44,172 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 13:01:44,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=966, Invalid=2340, Unknown=0, NotChecked=0, Total=3306 [2024-10-11 13:01:44,176 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 200 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:01:44,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 394 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:01:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 13:01:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 224. [2024-10-11 13:01:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 123 states have (on average 1.056910569105691) internal successors, (130), 124 states have internal predecessors, (130), 81 states have call successors, (81), 19 states have call predecessors, (81), 19 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 13:01:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 292 transitions. [2024-10-11 13:01:44,229 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 292 transitions. Word has length 163 [2024-10-11 13:01:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:01:44,232 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 292 transitions. [2024-10-11 13:01:44,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.7916666666666665) internal successors, (91), 23 states have internal predecessors, (91), 9 states have call successors, (59), 5 states have call predecessors, (59), 9 states have return successors, (60), 9 states have call predecessors, (60), 9 states have call successors, (60) [2024-10-11 13:01:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 292 transitions. [2024-10-11 13:01:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:01:44,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:44,239 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:01:44,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:01:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:01:44,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:44,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 342299740, now seen corresponding path program 1 times [2024-10-11 13:01:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:01:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232406946] [2024-10-11 13:01:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:01:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:01:44,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:01:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:01:44,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:01:44,665 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:01:44,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:01:44,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:01:44,670 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 13:01:44,786 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:01:44,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:01:44 BoogieIcfgContainer [2024-10-11 13:01:44,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:01:44,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:01:44,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:01:44,791 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:01:44,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:01:38" (3/4) ... [2024-10-11 13:01:44,793 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:01:44,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:01:44,795 INFO L158 Benchmark]: Toolchain (without parser) took 7299.25ms. Allocated memory was 184.5MB in the beginning and 346.0MB in the end (delta: 161.5MB). Free memory was 127.2MB in the beginning and 268.5MB in the end (delta: -141.4MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-10-11 13:01:44,795 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:01:44,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.99ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 111.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:01:44,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.31ms. Allocated memory is still 184.5MB. Free memory was 111.1MB in the beginning and 107.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:01:44,796 INFO L158 Benchmark]: Boogie Preprocessor took 69.65ms. Allocated memory is still 184.5MB. Free memory was 107.5MB in the beginning and 102.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:01:44,796 INFO L158 Benchmark]: RCFGBuilder took 548.09ms. Allocated memory is still 184.5MB. Free memory was 102.0MB in the beginning and 78.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 13:01:44,797 INFO L158 Benchmark]: TraceAbstraction took 6199.30ms. Allocated memory was 184.5MB in the beginning and 346.0MB in the end (delta: 161.5MB). Free memory was 77.7MB in the beginning and 269.6MB in the end (delta: -191.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:01:44,797 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 346.0MB. Free memory was 269.6MB in the beginning and 268.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:01:44,799 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.17ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.99ms. Allocated memory is still 184.5MB. Free memory was 126.7MB in the beginning and 111.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.31ms. Allocated memory is still 184.5MB. Free memory was 111.1MB in the beginning and 107.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.65ms. Allocated memory is still 184.5MB. Free memory was 107.5MB in the beginning and 102.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 548.09ms. Allocated memory is still 184.5MB. Free memory was 102.0MB in the beginning and 78.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6199.30ms. Allocated memory was 184.5MB in the beginning and 346.0MB in the end (delta: 161.5MB). Free memory was 77.7MB in the beginning and 269.6MB in the end (delta: -191.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 346.0MB. Free memory was 269.6MB in the beginning and 268.5MB in the end (delta: 1.0MB). There was no memory consumed. 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 someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int last_1_var_1_9 = 4; [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] CALL updateLastVariables() [L132] last_1_var_1_9 = var_1_9 [L142] RET updateLastVariables() [L143] CALL updateVariables() [L88] var_1_4 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L90] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L91] var_1_6 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L92] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_8=-10, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L93] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L94] var_1_8 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L95] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L96] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L96] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L97] var_1_10 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L98] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L99] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L100] var_1_12 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L101] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L102] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L102] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L104] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L105] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L105] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L106] var_1_18 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L107] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L108] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L108] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L110] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L111] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L111] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L116] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L119] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L120] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L120] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L121] var_1_25 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L122] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L123] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L123] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L124] var_1_28 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L125] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L126] var_1_29 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L127] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L128] var_1_30 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L129] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L143] RET updateVariables() [L144] CALL step() [L48] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=50, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L51] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L52] COND TRUE \read(var_1_4) [L53] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L57] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2139275268, var_1_31=2139275268, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L58] COND FALSE !(var_1_23 < var_1_23) [L69] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=-127, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2139275268, var_1_31=2139275268, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L71] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=-127, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=-127, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2139275268, var_1_31=2139275268, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=4] [L72] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L79] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=-127, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=2139275268, var_1_31=2139275268, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=-32769] [L81] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L84] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=-127, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2139275267, var_1_28=2139275267, var_1_30=2139275268, var_1_31=2139275268, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=-32769] [L144] RET step() [L145] CALL, EXPR property() [L135-L136] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=-127, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2139275267, var_1_28=2139275267, var_1_30=2139275268, var_1_31=2139275268, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=126, var_1_12=2139275262, var_1_13=-32769, var_1_17=-1, var_1_18=30, var_1_19=31, var_1_1=-127, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=2139275267, var_1_28=2139275267, var_1_30=2139275268, var_1_31=2139275268, var_1_4=1, var_1_6=1, var_1_8=-127, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 4, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 460 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 733 IncrementalHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 286 mSDtfsCounter, 733 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=3, InterpolantAutomatonStates: 52, 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, 33 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 3650 SizeOfPredicates, 6 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6783/7020 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-10-11 13:01:44,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-96.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bc4343435e8b0f90e9fafca790203e82878241d49cdad6f8cc3fc03787f7fe2b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:01:46,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:01:47,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:01:47,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:01:47,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:01:47,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:01:47,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:01:47,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:01:47,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:01:47,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:01:47,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:01:47,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:01:47,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:01:47,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:01:47,070 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:01:47,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:01:47,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:01:47,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:01:47,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:01:47,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:01:47,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:01:47,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:01:47,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:01:47,075 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:01:47,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:01:47,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:01:47,076 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:01:47,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:01:47,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:01:47,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:01:47,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:01:47,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:01:47,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:01:47,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:01:47,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:01:47,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:01:47,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:01:47,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:01:47,087 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:01:47,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:01:47,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:01:47,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:01:47,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:01:47,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:01:47,089 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:01:47,090 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-clean/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-clean/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 -> bc4343435e8b0f90e9fafca790203e82878241d49cdad6f8cc3fc03787f7fe2b [2024-10-11 13:01:47,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:01:47,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:01:47,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:01:47,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:01:47,424 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:01:47,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-96.i [2024-10-11 13:01:48,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:01:49,164 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:01:49,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-96.i [2024-10-11 13:01:49,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3a967ee9/24272092da3a4629b984d9bda37b60d7/FLAG370406e92 [2024-10-11 13:01:49,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3a967ee9/24272092da3a4629b984d9bda37b60d7 [2024-10-11 13:01:49,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:01:49,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:01:49,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:01:49,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:01:49,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:01:49,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6694392c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49, skipping insertion in model container [2024-10-11 13:01:49,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:01:49,418 WARN L248 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_operatoramount_amount50_file-96.i[915,928] [2024-10-11 13:01:49,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:01:49,522 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:01:49,536 WARN L248 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_operatoramount_amount50_file-96.i[915,928] [2024-10-11 13:01:49,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:01:49,601 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:01:49,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49 WrapperNode [2024-10-11 13:01:49,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:01:49,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:01:49,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:01:49,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:01:49,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,658 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-10-11 13:01:49,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:01:49,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:01:49,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:01:49,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:01:49,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,700 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-10-11 13:01:49,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:01:49,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:01:49,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:01:49,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:01:49,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (1/1) ... [2024-10-11 13:01:49,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:01:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:01:49,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:01:49,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:01:49,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:01:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:01:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:01:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:01:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:01:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:01:49,902 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:01:49,904 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:01:52,072 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 13:01:52,072 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:01:52,134 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:01:52,135 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:01:52,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:01:52 BoogieIcfgContainer [2024-10-11 13:01:52,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:01:52,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:01:52,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:01:52,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:01:52,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:01:49" (1/3) ... [2024-10-11 13:01:52,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3816f001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:01:52, skipping insertion in model container [2024-10-11 13:01:52,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:01:49" (2/3) ... [2024-10-11 13:01:52,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3816f001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:01:52, skipping insertion in model container [2024-10-11 13:01:52,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:01:52" (3/3) ... [2024-10-11 13:01:52,146 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-96.i [2024-10-11 13:01:52,162 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:01:52,162 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:01:52,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:01:52,239 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;@56a41fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:01:52,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:01:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:01:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:01:52,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:52,257 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:01:52,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:52,265 INFO L85 PathProgramCache]: Analyzing trace with hash -715942634, now seen corresponding path program 1 times [2024-10-11 13:01:52,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:01:52,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54843681] [2024-10-11 13:01:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:52,280 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-10-11 13:01:52,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:01:52,284 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:01:52,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:01:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:52,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:01:52,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:01:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-10-11 13:01:52,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:01:52,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:01:52,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54843681] [2024-10-11 13:01:52,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54843681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:01:52,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:01:52,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:01:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583382467] [2024-10-11 13:01:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:01:52,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:01:52,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:01:52,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:01:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:01:52,758 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 13:01:54,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:01:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:01:54,329 INFO L93 Difference]: Finished difference Result 128 states and 229 transitions. [2024-10-11 13:01:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:01:54,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 163 [2024-10-11 13:01:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:01:54,358 INFO L225 Difference]: With dead ends: 128 [2024-10-11 13:01:54,358 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 13:01:54,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-10-11 13:01:54,366 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:01:54,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 13:01:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 13:01:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 13:01:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 13:01:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 93 transitions. [2024-10-11 13:01:54,420 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 93 transitions. Word has length 163 [2024-10-11 13:01:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:01:54,420 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 93 transitions. [2024-10-11 13:01:54,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 13:01:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 93 transitions. [2024-10-11 13:01:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:01:54,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:54,424 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:01:54,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:01:54,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:01:54,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:54,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -358824420, now seen corresponding path program 1 times [2024-10-11 13:01:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:01:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673557123] [2024-10-11 13:01:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:54,631 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-10-11 13:01:54,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:01:54,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:01:54,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:01:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:54,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:01:54,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:01:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 13:01:55,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:01:55,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:01:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673557123] [2024-10-11 13:01:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673557123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:01:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:01:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:01:55,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860631428] [2024-10-11 13:01:55,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:01:55,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:01:55,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:01:55,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:01:55,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:01:55,568 INFO L87 Difference]: Start difference. First operand 62 states and 93 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 13:01:58,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:01:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:01:59,016 INFO L93 Difference]: Finished difference Result 185 states and 278 transitions. [2024-10-11 13:01:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:01:59,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 163 [2024-10-11 13:01:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:01:59,037 INFO L225 Difference]: With dead ends: 185 [2024-10-11 13:01:59,037 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 13:01:59,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:01:59,039 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 45 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:01:59,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 262 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-11 13:01:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 13:01:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 110. [2024-10-11 13:01:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:01:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 167 transitions. [2024-10-11 13:01:59,067 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 167 transitions. Word has length 163 [2024-10-11 13:01:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:01:59,068 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 167 transitions. [2024-10-11 13:01:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 13:01:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 167 transitions. [2024-10-11 13:01:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:01:59,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:01:59,070 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:01:59,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:01:59,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 13:01:59,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:01:59,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:01:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash 342240158, now seen corresponding path program 1 times [2024-10-11 13:01:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:01:59,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931308296] [2024-10-11 13:01:59,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:01:59,277 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-10-11 13:01:59,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:01:59,282 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 13:01:59,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (4)] Waiting until timeout for monitored process [2024-10-11 13:01:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:01:59,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 13:01:59,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:02:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 928 proven. 108 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-11 13:02:00,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:02:00,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:02:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931308296] [2024-10-11 13:02:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931308296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:02:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [881700556] [2024-10-11 13:02:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:02:00,884 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:02:00,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:02:00,886 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:02:00,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 13:02:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:02:01,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:02:01,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:02:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 686 proven. 48 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2024-10-11 13:02:01,801 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:02:02,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [881700556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:02:02,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:02:02,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2024-10-11 13:02:02,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227891102] [2024-10-11 13:02:02,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:02:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:02:02,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:02:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:02:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:02:02,161 INFO L87 Difference]: Start difference. First operand 110 states and 167 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-10-11 13:02:06,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:02:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:02:07,322 INFO L93 Difference]: Finished difference Result 280 states and 389 transitions. [2024-10-11 13:02:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 13:02:07,323 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) Word has length 163 [2024-10-11 13:02:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:02:07,329 INFO L225 Difference]: With dead ends: 280 [2024-10-11 13:02:07,329 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 13:02:07,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=909, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 13:02:07,331 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 108 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:02:07,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 438 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 13:02:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 13:02:07,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2024-10-11 13:02:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 105 states have (on average 1.0666666666666667) internal successors, (112), 106 states have internal predecessors, (112), 81 states have call successors, (81), 13 states have call predecessors, (81), 13 states have return successors, (81), 80 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 13:02:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 274 transitions. [2024-10-11 13:02:07,362 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 274 transitions. Word has length 163 [2024-10-11 13:02:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:02:07,363 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 274 transitions. [2024-10-11 13:02:07,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (42), 4 states have call predecessors, (42), 7 states have return successors, (43), 4 states have call predecessors, (43), 4 states have call successors, (43) [2024-10-11 13:02:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 274 transitions. [2024-10-11 13:02:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-11 13:02:07,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:02:07,366 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:02:07,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-10-11 13:02:07,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (4)] Ended with exit code 0 [2024-10-11 13:02:07,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate-clean/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-10-11 13:02:07,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:02:07,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:02:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash 342299740, now seen corresponding path program 1 times [2024-10-11 13:02:07,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:02:07,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624096417] [2024-10-11 13:02:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:02:07,769 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-10-11 13:02:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:02:07,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-11 13:02:07,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 13:02:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:02:08,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 13:02:08,040 INFO L278 TraceCheckSpWp]: Computing forward predicates...