./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_fillercode_fillercodesize_normal_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ea08dc62acc30bf27bdbe344366e1e3ed766f07a4fc179eccedd3ea159fdcb7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:21:58,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:21:58,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:21:58,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:21:58,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:21:58,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:21:58,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:21:58,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:21:58,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:21:58,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:21:58,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:21:58,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:21:58,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:21:58,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:21:58,213 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:21:58,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:21:58,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:21:58,214 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:21:58,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:21:58,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:21:58,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:21:58,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:21:58,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:21:58,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:21:58,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:21:58,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:21:58,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:21:58,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:21:58,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:21:58,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:21:58,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:21:58,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:21:58,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:21:58,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:21:58,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:21:58,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:21:58,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:21:58,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:21:58,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:21:58,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:21:58,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:21:58,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:21:58,226 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ea08dc62acc30bf27bdbe344366e1e3ed766f07a4fc179eccedd3ea159fdcb7 [2024-10-13 00:21:58,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:21:58,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:21:58,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:21:58,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:21:58,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:21:58,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-22.i [2024-10-13 00:22:00,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:22:00,403 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:22:00,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-22.i [2024-10-13 00:22:00,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066141448/2dfbe69432cf40b3bf8b4d032877ca5a/FLAG232438285 [2024-10-13 00:22:00,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066141448/2dfbe69432cf40b3bf8b4d032877ca5a [2024-10-13 00:22:00,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:22:00,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:22:00,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:22:00,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:22:00,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:22:00,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:00,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@469dd07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00, skipping insertion in model container [2024-10-13 00:22:00,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:00,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:22:00,686 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_fillercode_fillercodesize_normal_file-22.i[913,926] [2024-10-13 00:22:00,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:22:00,844 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:22:00,857 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_fillercode_fillercodesize_normal_file-22.i[913,926] [2024-10-13 00:22:00,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:22:00,932 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:22:00,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00 WrapperNode [2024-10-13 00:22:00,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:22:00,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:22:00,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:22:00,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:22:00,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:00,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,002 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-10-13 00:22:01,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:22:01,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:22:01,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:22:01,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:22:01,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,066 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-13 00:22:01,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:22:01,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:22:01,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:22:01,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:22:01,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (1/1) ... [2024-10-13 00:22:01,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:22:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:22:01,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:22:01,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:22:01,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:22:01,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:22:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:22:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:22:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:22:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:22:01,340 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:22:01,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:22:01,690 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-13 00:22:01,691 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:22:01,755 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:22:01,756 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:22:01,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:01 BoogieIcfgContainer [2024-10-13 00:22:01,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:22:01,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:22:01,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:22:01,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:22:01,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:22:00" (1/3) ... [2024-10-13 00:22:01,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cbeb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:01, skipping insertion in model container [2024-10-13 00:22:01,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:00" (2/3) ... [2024-10-13 00:22:01,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cbeb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:01, skipping insertion in model container [2024-10-13 00:22:01,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:01" (3/3) ... [2024-10-13 00:22:01,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-22.i [2024-10-13 00:22:01,788 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:22:01,789 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:22:01,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:22:01,877 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;@476d1c3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:22:01,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:22:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:22:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 00:22:01,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:01,896 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:01,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:01,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1217131889, now seen corresponding path program 1 times [2024-10-13 00:22:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:22:01,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043787982] [2024-10-13 00:22:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:01,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:22:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:22:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:22:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:22:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:22:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:22:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:22:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:22:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:22:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:22:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:22:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:22:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:22:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:22:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:22:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:22:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:22:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:22:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:22:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:22:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:22:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:22:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:22:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:22:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 00:22:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:22:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043787982] [2024-10-13 00:22:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043787982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:22:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:22:02,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:22:02,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546756974] [2024-10-13 00:22:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:22:02,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:22:02,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:22:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:22:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:22:02,355 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 states have internal predecessors, (57), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:22:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:22:02,425 INFO L93 Difference]: Finished difference Result 131 states and 227 transitions. [2024-10-13 00:22:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:22:02,433 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-10-13 00:22:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:22:02,440 INFO L225 Difference]: With dead ends: 131 [2024-10-13 00:22:02,441 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 00:22:02,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:22:02,448 INFO L432 NwaCegarLoop]: 94 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, 94 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-13 00:22:02,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:22:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 00:22:02,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-13 00:22:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:22:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2024-10-13 00:22:02,491 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 147 [2024-10-13 00:22:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:22:02,492 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2024-10-13 00:22:02,492 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:22:02,492 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2024-10-13 00:22:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 00:22:02,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:02,496 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:02,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:22:02,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:02,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1461840171, now seen corresponding path program 1 times [2024-10-13 00:22:02,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:22:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113990729] [2024-10-13 00:22:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:22:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:22:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:22:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:22:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:22:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:22:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:22:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:22:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:22:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:22:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:22:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:22:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:22:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:22:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:22:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:22:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:22:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:22:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:22:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:22:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:22:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:22:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:22:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:22:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 00:22:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:22:03,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113990729] [2024-10-13 00:22:03,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113990729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:22:03,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:22:03,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:22:03,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909133480] [2024-10-13 00:22:03,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:22:03,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:22:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:22:03,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:22:03,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:22:03,151 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 00:22:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:22:03,323 INFO L93 Difference]: Finished difference Result 129 states and 193 transitions. [2024-10-13 00:22:03,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:22:03,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2024-10-13 00:22:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:22:03,326 INFO L225 Difference]: With dead ends: 129 [2024-10-13 00:22:03,326 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 00:22:03,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-13 00:22:03,328 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:22:03,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 91 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:22:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 00:22:03,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-13 00:22:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:22:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2024-10-13 00:22:03,340 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 147 [2024-10-13 00:22:03,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:22:03,342 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2024-10-13 00:22:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 00:22:03,342 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2024-10-13 00:22:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 00:22:03,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:03,345 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:03,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:22:03,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:03,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash -126507731, now seen corresponding path program 1 times [2024-10-13 00:22:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:22:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413074645] [2024-10-13 00:22:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:22:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:22:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:22:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:22:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:22:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:22:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:22:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:22:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:22:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:22:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:22:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:22:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:22:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:22:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:22:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:22:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:22:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:22:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:22:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:22:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:22:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:22:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:22:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:22:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 00:22:04,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:22:04,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413074645] [2024-10-13 00:22:04,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413074645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:22:04,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81366911] [2024-10-13 00:22:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:04,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:22:04,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:22:04,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:22:04,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:22:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 00:22:04,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:22:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 338 proven. 102 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-10-13 00:22:05,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:22:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 105 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-10-13 00:22:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81366911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:22:06,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:22:06,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-10-13 00:22:06,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15844138] [2024-10-13 00:22:06,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:22:06,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 00:22:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:22:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 00:22:06,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-10-13 00:22:06,172 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 24 states, 23 states have (on average 4.260869565217392) internal successors, (98), 22 states have internal predecessors, (98), 7 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 7 states have call predecessors, (69), 7 states have call successors, (69) [2024-10-13 00:22:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:22:07,925 INFO L93 Difference]: Finished difference Result 309 states and 438 transitions. [2024-10-13 00:22:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-13 00:22:07,926 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.260869565217392) internal successors, (98), 22 states have internal predecessors, (98), 7 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 7 states have call predecessors, (69), 7 states have call successors, (69) Word has length 147 [2024-10-13 00:22:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:22:07,930 INFO L225 Difference]: With dead ends: 309 [2024-10-13 00:22:07,931 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 00:22:07,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=705, Invalid=2265, Unknown=0, NotChecked=0, Total=2970 [2024-10-13 00:22:07,933 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 352 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:22:07,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 673 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:22:07,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 00:22:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 183. [2024-10-13 00:22:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 106 states have (on average 1.179245283018868) internal successors, (125), 107 states have internal predecessors, (125), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-13 00:22:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 263 transitions. [2024-10-13 00:22:07,977 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 263 transitions. Word has length 147 [2024-10-13 00:22:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:22:07,978 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 263 transitions. [2024-10-13 00:22:07,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.260869565217392) internal successors, (98), 22 states have internal predecessors, (98), 7 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 7 states have call predecessors, (69), 7 states have call successors, (69) [2024-10-13 00:22:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 263 transitions. [2024-10-13 00:22:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 00:22:07,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:07,981 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:08,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 00:22:08,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:22:08,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:08,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash -519534741, now seen corresponding path program 1 times [2024-10-13 00:22:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:22:08,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898350945] [2024-10-13 00:22:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:22:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:22:08,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:22:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:22:08,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:22:08,384 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:22:08,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:22:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:22:08,390 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:22:08,473 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:22:08,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:22:08 BoogieIcfgContainer [2024-10-13 00:22:08,476 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:22:08,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:22:08,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:22:08,477 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:22:08,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:01" (3/4) ... [2024-10-13 00:22:08,479 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:22:08,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:22:08,482 INFO L158 Benchmark]: Toolchain (without parser) took 8027.69ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 113.4MB in the beginning and 114.1MB in the end (delta: -662.1kB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2024-10-13 00:22:08,483 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:22:08,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.57ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 151.3MB in the end (delta: -38.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-10-13 00:22:08,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.07ms. Allocated memory is still 184.5MB. Free memory was 151.3MB in the beginning and 147.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:22:08,484 INFO L158 Benchmark]: Boogie Preprocessor took 127.54ms. Allocated memory is still 184.5MB. Free memory was 146.2MB in the beginning and 139.6MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:22:08,484 INFO L158 Benchmark]: RCFGBuilder took 625.20ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 112.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 00:22:08,485 INFO L158 Benchmark]: TraceAbstraction took 6716.47ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 112.7MB in the beginning and 115.2MB in the end (delta: -2.5MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2024-10-13 00:22:08,485 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 262.1MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:22:08,487 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 142.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.57ms. Allocated memory is still 184.5MB. Free memory was 113.3MB in the beginning and 151.3MB in the end (delta: -38.1MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.07ms. Allocated memory is still 184.5MB. Free memory was 151.3MB in the beginning and 147.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.54ms. Allocated memory is still 184.5MB. Free memory was 146.2MB in the beginning and 139.6MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 625.20ms. Allocated memory is still 184.5MB. Free memory was 138.7MB in the beginning and 112.7MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6716.47ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 112.7MB in the beginning and 115.2MB in the end (delta: -2.5MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 262.1MB. Free memory is still 114.1MB. 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 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned short int var_1_4 = 256; [L24] unsigned short int var_1_6 = 10000; [L25] unsigned short int var_1_7 = 10000; [L26] unsigned short int var_1_8 = 128; [L27] unsigned short int var_1_9 = 8; [L28] unsigned char var_1_10 = 100; [L29] unsigned char var_1_11 = 64; [L30] unsigned char var_1_12 = 16; [L31] unsigned short int var_1_13 = 256; [L32] unsigned short int var_1_17 = 4; [L33] double var_1_18 = 64.2; [L34] unsigned short int var_1_19 = 53045; [L35] double var_1_20 = 1.75; [L36] double var_1_21 = 50.35; [L37] double var_1_22 = 5.5; [L38] double var_1_23 = 7.125; [L39] unsigned long int var_1_24 = 50; [L40] unsigned long int var_1_25 = 1907531378; [L41] unsigned long int var_1_26 = 8; [L42] unsigned char var_1_27 = 0; [L43] unsigned long int last_1_var_1_24 = 50; [L44] unsigned char last_1_var_1_27 = 0; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L125] last_1_var_1_24 = var_1_24 [L126] last_1_var_1_27 = var_1_27 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L87] var_1_4 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L88] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L90] var_1_6 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_6 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L91] RET assume_abort_if_not(var_1_6 >= 8191) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L92] CALL assume_abort_if_not(var_1_6 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L92] RET assume_abort_if_not(var_1_6 <= 16384) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=10000, var_1_8=128, var_1_9=8] [L93] var_1_7 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_7 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L94] RET assume_abort_if_not(var_1_7 >= 8192) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L95] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L95] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=128, var_1_9=8] [L96] var_1_8 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_9=8] [L97] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_9=8] [L98] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=8] [L98] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=8] [L99] var_1_9 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383] [L100] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383] [L101] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L101] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L103] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L104] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L104] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L105] var_1_12 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L107] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L107] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L108] var_1_18 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L109] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L110] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L110] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L111] var_1_19 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_19 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L112] RET assume_abort_if_not(var_1_19 >= 49150) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L113] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L113] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L114] var_1_21 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L115] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L116] var_1_22 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L117] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L118] var_1_23 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L119] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L120] var_1_25 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_25 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L121] RET assume_abort_if_not(var_1_25 >= 1073741823) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L122] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L122] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L137] RET updateVariables() [L138] CALL step() [L48] COND FALSE !(\read(last_1_var_1_27)) [L51] var_1_20 = var_1_22 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L53] COND TRUE (- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22))) [L54] var_1_27 = 0 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L56] EXPR var_1_8 << var_1_4 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L56] COND TRUE var_1_9 < (var_1_8 << var_1_4) [L57] var_1_10 = (var_1_11 + var_1_12) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L61] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=256, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L62] COND TRUE (var_1_10 <= var_1_10) || stepLocal_0 [L63] var_1_13 = ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L67] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, stepLocal_1=16383, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L68] COND FALSE !(stepLocal_1 == last_1_var_1_24) [L71] var_1_24 = (var_1_10 + (var_1_25 - var_1_11)) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L73] signed long int stepLocal_2 = var_1_19 - var_1_7; VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, stepLocal_2=32767, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L74] COND FALSE !(var_1_10 > stepLocal_2) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=4, var_1_19=-1074151426, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L77] COND TRUE var_1_20 < var_1_20 [L78] var_1_1 = ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=4, var_1_19=-1074151426, var_1_1=134, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L82] COND TRUE (var_1_20 / var_1_18) > var_1_20 [L83] var_1_17 = ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=32759, var_1_19=-1074151426, var_1_1=134, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=32759, var_1_19=-1074151426, var_1_1=134, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L129-L130] return ((((((((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11)))) && (((var_1_10 <= var_1_10) || var_1_27) ? (var_1_13 == ((unsigned short int) ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))))) : (var_1_13 == ((unsigned short int) var_1_10)))) && (((var_1_20 / var_1_18) > var_1_20) ? (var_1_17 == ((unsigned short int) ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7))) : 1)) && (last_1_var_1_27 ? (var_1_20 == ((double) (((((((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) > (16.6)) ? (((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) : (16.6))) - var_1_23))) : (var_1_20 == ((double) var_1_22)))) && ((var_1_7 == last_1_var_1_24) ? (var_1_24 == ((unsigned long int) (2332545940u - (1490203111u - var_1_11)))) : (var_1_24 == ((unsigned long int) (var_1_10 + (var_1_25 - var_1_11)))))) && ((var_1_10 > (var_1_19 - var_1_7)) ? (var_1_26 == ((unsigned long int) var_1_10)) : 1)) && (((- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22)))) ? (var_1_27 == ((unsigned char) 0)) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=32759, var_1_19=-1074151426, var_1_1=134, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=134, var_1_11=127, var_1_12=7, var_1_13=134, var_1_17=32759, var_1_19=-1074151426, var_1_1=134, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741830, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=16384, var_1_7=16383, var_1_8=16383, var_1_9=16382] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 858 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 598 mSDsCounter, 371 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 968 IncrementalHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 371 mSolverCounterUnsat, 260 mSDtfsCounter, 968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=3, InterpolantAutomatonStates: 43, 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, 62 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 3494 SizeOfPredicates, 3 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4799/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:22:08,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ea08dc62acc30bf27bdbe344366e1e3ed766f07a4fc179eccedd3ea159fdcb7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:22:11,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:22:11,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:22:11,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:22:11,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:22:11,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:22:11,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:22:11,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:22:11,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:22:11,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:22:11,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:22:11,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:22:11,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:22:11,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:22:11,330 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:22:11,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:22:11,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:22:11,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:22:11,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:22:11,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:22:11,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:22:11,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:22:11,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:22:11,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:22:11,337 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:22:11,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:22:11,337 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:22:11,338 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:22:11,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:22:11,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:22:11,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:22:11,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:22:11,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:22:11,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:22:11,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:22:11,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:22:11,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:22:11,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:22:11,350 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:22:11,350 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:22:11,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:22:11,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:22:11,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:22:11,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:22:11,354 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:22:11,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ea08dc62acc30bf27bdbe344366e1e3ed766f07a4fc179eccedd3ea159fdcb7 [2024-10-13 00:22:11,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:22:11,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:22:11,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:22:11,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:22:11,719 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:22:11,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-22.i [2024-10-13 00:22:13,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:22:13,770 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:22:13,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-22.i [2024-10-13 00:22:13,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4f4044a/ee2eec06383142caa43b33f4d78f90f4/FLAG3c62ebabb [2024-10-13 00:22:13,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4f4044a/ee2eec06383142caa43b33f4d78f90f4 [2024-10-13 00:22:13,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:22:13,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:22:13,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:22:13,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:22:13,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:22:13,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:13" (1/1) ... [2024-10-13 00:22:13,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eba1f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:13, skipping insertion in model container [2024-10-13 00:22:13,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:22:13" (1/1) ... [2024-10-13 00:22:13,860 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:22:14,058 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_fillercode_fillercodesize_normal_file-22.i[913,926] [2024-10-13 00:22:14,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:22:14,155 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:22:14,169 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_fillercode_fillercodesize_normal_file-22.i[913,926] [2024-10-13 00:22:14,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:22:14,239 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:22:14,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14 WrapperNode [2024-10-13 00:22:14,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:22:14,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:22:14,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:22:14,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:22:14,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,306 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-10-13 00:22:14,307 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:22:14,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:22:14,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:22:14,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:22:14,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,347 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-13 00:22:14,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:22:14,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:22:14,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:22:14,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:22:14,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (1/1) ... [2024-10-13 00:22:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:22:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:22:14,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:22:14,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:22:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:22:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:22:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:22:14,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:22:14,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:22:14,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:22:14,600 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:22:14,603 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:22:23,961 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 00:22:23,961 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:22:23,999 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:22:24,000 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:22:24,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:24 BoogieIcfgContainer [2024-10-13 00:22:24,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:22:24,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:22:24,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:22:24,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:22:24,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:22:13" (1/3) ... [2024-10-13 00:22:24,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c598a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:24, skipping insertion in model container [2024-10-13 00:22:24,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:22:14" (2/3) ... [2024-10-13 00:22:24,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c598a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:22:24, skipping insertion in model container [2024-10-13 00:22:24,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:22:24" (3/3) ... [2024-10-13 00:22:24,008 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-22.i [2024-10-13 00:22:24,022 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:22:24,023 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:22:24,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:22:24,081 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;@117df07a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:22:24,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:22:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:22:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:22:24,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:24,098 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:24,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1923180320, now seen corresponding path program 1 times [2024-10-13 00:22:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:22:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630944733] [2024-10-13 00:22:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:24,117 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-13 00:22:24,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:22:24,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:22:24,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:22:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:25,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:22:25,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:22:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-10-13 00:22:25,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:22:25,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:22:25,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630944733] [2024-10-13 00:22:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630944733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:22:25,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:22:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:22:25,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040090736] [2024-10-13 00:22:25,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:22:25,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:22:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:22:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:22:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:22:25,349 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:22:29,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:22:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:22:29,703 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2024-10-13 00:22:29,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:22:29,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2024-10-13 00:22:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:22:29,831 INFO L225 Difference]: With dead ends: 117 [2024-10-13 00:22:29,831 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 00:22:29,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:22:29,838 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:22:29,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 00:22:29,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 00:22:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 00:22:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:22:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-10-13 00:22:29,882 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 144 [2024-10-13 00:22:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:22:29,883 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-10-13 00:22:29,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-13 00:22:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-10-13 00:22:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:22:29,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:29,887 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:29,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:22:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:22:30,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:30,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:30,090 INFO L85 PathProgramCache]: Analyzing trace with hash 850513766, now seen corresponding path program 1 times [2024-10-13 00:22:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:22:30,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571810408] [2024-10-13 00:22:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:30,093 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-13 00:22:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:22:30,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:22:30,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:22:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:31,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 00:22:31,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:22:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 00:22:34,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:22:34,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:22:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571810408] [2024-10-13 00:22:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571810408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:22:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:22:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:22:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424249452] [2024-10-13 00:22:34,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:22:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:22:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:22:34,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:22:34,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:22:34,870 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 00:22:39,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:22:39,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:22:39,489 INFO L93 Difference]: Finished difference Result 115 states and 171 transitions. [2024-10-13 00:22:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:22:39,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 144 [2024-10-13 00:22:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:22:39,610 INFO L225 Difference]: With dead ends: 115 [2024-10-13 00:22:39,610 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 00:22:39,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:22:39,613 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:22:39,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 80 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-13 00:22:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 00:22:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-10-13 00:22:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 00:22:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-10-13 00:22:39,627 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 144 [2024-10-13 00:22:39,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:22:39,629 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-10-13 00:22:39,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-13 00:22:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-10-13 00:22:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 00:22:39,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:39,632 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:39,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 00:22:39,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:22:39,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:39,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:39,834 INFO L85 PathProgramCache]: Analyzing trace with hash -160603484, now seen corresponding path program 1 times [2024-10-13 00:22:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:22:39,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369326459] [2024-10-13 00:22:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:39,835 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-13 00:22:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:22:39,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:22:39,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 00:22:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:40,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 00:22:40,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:22:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 338 proven. 102 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-10-13 00:22:52,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:22:56,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:22:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369326459] [2024-10-13 00:22:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369326459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:22:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [862139833] [2024-10-13 00:22:56,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:56,522 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 00:22:56,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 00:22:56,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 00:22:56,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 00:22:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:58,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 00:22:58,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:23:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-13 00:23:05,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:23:07,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [862139833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:23:07,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:23:07,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2024-10-13 00:23:07,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274688452] [2024-10-13 00:23:07,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:23:07,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 00:23:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:23:07,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 00:23:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2024-10-13 00:23:07,807 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-10-13 00:23:19,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:23:23,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:23:27,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:23:31,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []