./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_fillercodestructure_filler-pe-ci_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_fillercodestructure_filler-pe-ci_file-70.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 c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:58:14,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:58:14,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:58:14,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:58:14,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:58:14,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:58:14,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:58:14,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:58:14,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:58:15,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:58:15,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:58:15,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:58:15,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:58:15,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:58:15,002 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:58:15,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:58:15,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:58:15,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:58:15,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:58:15,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:58:15,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:58:15,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:58:15,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:58:15,007 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:58:15,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:58:15,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:58:15,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:58:15,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:58:15,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:58:15,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:58:15,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:58:15,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:58:15,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:58:15,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:58:15,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:58:15,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:58:15,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:58:15,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:58:15,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:58:15,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:58:15,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:58:15,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:58:15,014 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 -> c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c [2024-10-24 06:58:15,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:58:15,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:58:15,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:58:15,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:58:15,291 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:58:15,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-24 06:58:16,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:58:16,940 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:58:16,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-24 06:58:16,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2efe899/da02d49322c54a19b5a7fb663c701f39/FLAG09d2ad935 [2024-10-24 06:58:16,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c2efe899/da02d49322c54a19b5a7fb663c701f39 [2024-10-24 06:58:16,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:58:16,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:58:16,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:58:16,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:58:16,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:58:16,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:58:16" (1/1) ... [2024-10-24 06:58:16,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa8aaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:16, skipping insertion in model container [2024-10-24 06:58:16,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:58:16" (1/1) ... [2024-10-24 06:58:17,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:58:17,218 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_fillercodestructure_filler-pe-ci_file-70.i[919,932] [2024-10-24 06:58:17,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:58:17,327 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:58:17,340 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_fillercodestructure_filler-pe-ci_file-70.i[919,932] [2024-10-24 06:58:17,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:58:17,456 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:58:17,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17 WrapperNode [2024-10-24 06:58:17,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:58:17,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:58:17,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:58:17,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:58:17,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,515 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-24 06:58:17,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:58:17,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:58:17,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:58:17,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:58:17,531 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,554 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-24 06:58:17,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,569 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:58:17,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:58:17,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:58:17,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:58:17,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (1/1) ... [2024-10-24 06:58:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:58:17,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:17,635 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-24 06:58:17,637 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-24 06:58:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:58:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:58:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:58:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:58:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:58:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:58:17,752 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:58:17,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:58:18,129 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 06:58:18,130 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:58:18,189 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:58:18,189 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:58:18,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:18 BoogieIcfgContainer [2024-10-24 06:58:18,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:58:18,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:58:18,196 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:58:18,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:58:18,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:58:16" (1/3) ... [2024-10-24 06:58:18,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189a54f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:58:18, skipping insertion in model container [2024-10-24 06:58:18,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:17" (2/3) ... [2024-10-24 06:58:18,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189a54f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:58:18, skipping insertion in model container [2024-10-24 06:58:18,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:18" (3/3) ... [2024-10-24 06:58:18,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-24 06:58:18,220 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:58:18,221 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:58:18,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:58:18,303 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;@37db7746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:58:18,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:58:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 47 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 06:58:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 06:58:18,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:18,323 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:18,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:18,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:18,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1327964579, now seen corresponding path program 1 times [2024-10-24 06:58:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:18,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496879248] [2024-10-24 06:58:18,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:58:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:58:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:58:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 06:58:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496879248] [2024-10-24 06:58:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496879248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:18,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:58:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838246139] [2024-10-24 06:58:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:18,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:58:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:18,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:58:18,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:58:18,776 INFO L87 Difference]: Start difference. First operand has 64 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 47 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 06:58:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:18,849 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2024-10-24 06:58:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:58:18,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-24 06:58:18,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:18,863 INFO L225 Difference]: With dead ends: 125 [2024-10-24 06:58:18,864 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 06:58:18,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-24 06:58:18,871 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-24 06:58:18,871 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-24 06:58:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 06:58:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-24 06:58:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.488888888888889) internal successors, (67), 45 states have internal predecessors, (67), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 06:58:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2024-10-24 06:58:18,910 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 104 [2024-10-24 06:58:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:18,910 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2024-10-24 06:58:18,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 06:58:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2024-10-24 06:58:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 06:58:18,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:18,915 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:18,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:58:18,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:18,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1585591273, now seen corresponding path program 1 times [2024-10-24 06:58:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:18,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329242358] [2024-10-24 06:58:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:58:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:58:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:58:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 06:58:19,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329242358] [2024-10-24 06:58:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329242358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:58:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45730484] [2024-10-24 06:58:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:19,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:58:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:58:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:58:19,256 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:19,330 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2024-10-24 06:58:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:58:19,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-24 06:58:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:19,335 INFO L225 Difference]: With dead ends: 163 [2024-10-24 06:58:19,337 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 06:58:19,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:58:19,339 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 49 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:19,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:58:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 06:58:19,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-10-24 06:58:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 06:58:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2024-10-24 06:58:19,364 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 104 [2024-10-24 06:58:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:19,365 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2024-10-24 06:58:19,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2024-10-24 06:58:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 06:58:19,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:19,367 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:19,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:58:19,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:19,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 715231317, now seen corresponding path program 1 times [2024-10-24 06:58:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640396106] [2024-10-24 06:58:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:58:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:58:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:58:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 06:58:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:20,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640396106] [2024-10-24 06:58:20,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640396106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 06:58:20,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610371991] [2024-10-24 06:58:20,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:20,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 06:58:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:20,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 06:58:20,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:58:20,389 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:20,707 INFO L93 Difference]: Finished difference Result 415 states and 636 transitions. [2024-10-24 06:58:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 06:58:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-24 06:58:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:20,715 INFO L225 Difference]: With dead ends: 415 [2024-10-24 06:58:20,717 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 06:58:20,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:58:20,719 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 199 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:20,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 271 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:58:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 06:58:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 262. [2024-10-24 06:58:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 211 states have (on average 1.5165876777251184) internal successors, (320), 215 states have internal predecessors, (320), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 06:58:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 408 transitions. [2024-10-24 06:58:20,771 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 408 transitions. Word has length 104 [2024-10-24 06:58:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:20,775 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 408 transitions. [2024-10-24 06:58:20,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 408 transitions. [2024-10-24 06:58:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 06:58:20,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:20,777 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:20,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:58:20,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash 322204307, now seen corresponding path program 1 times [2024-10-24 06:58:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735601290] [2024-10-24 06:58:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:58:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:58:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:58:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 06:58:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735601290] [2024-10-24 06:58:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735601290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:21,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:58:21,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:58:21,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104199212] [2024-10-24 06:58:21,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:21,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:58:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:21,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:58:21,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:58:21,144 INFO L87 Difference]: Start difference. First operand 262 states and 408 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:21,285 INFO L93 Difference]: Finished difference Result 770 states and 1164 transitions. [2024-10-24 06:58:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:58:21,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-24 06:58:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:21,292 INFO L225 Difference]: With dead ends: 770 [2024-10-24 06:58:21,292 INFO L226 Difference]: Without dead ends: 509 [2024-10-24 06:58:21,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-24 06:58:21,295 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:21,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 385 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:58:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-24 06:58:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 419. [2024-10-24 06:58:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 336 states have (on average 1.4702380952380953) internal successors, (494), 338 states have internal predecessors, (494), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 06:58:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2024-10-24 06:58:21,357 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 104 [2024-10-24 06:58:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:21,358 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2024-10-24 06:58:21,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2024-10-24 06:58:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 06:58:21,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:21,362 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:58:21,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:21,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 580369745, now seen corresponding path program 1 times [2024-10-24 06:58:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:21,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222470] [2024-10-24 06:58:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:58:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:58:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:58:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 06:58:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222470] [2024-10-24 06:58:21,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:58:21,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948849146] [2024-10-24 06:58:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:21,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:21,706 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-24 06:58:21,707 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-24 06:58:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:21,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 06:58:21,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:58:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-24 06:58:21,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:58:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 06:58:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948849146] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:58:22,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:58:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 06:58:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104524243] [2024-10-24 06:58:22,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:58:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 06:58:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 06:58:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:58:22,164 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 06:58:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:22,361 INFO L93 Difference]: Finished difference Result 761 states and 1117 transitions. [2024-10-24 06:58:22,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 06:58:22,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 104 [2024-10-24 06:58:22,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:22,367 INFO L225 Difference]: With dead ends: 761 [2024-10-24 06:58:22,367 INFO L226 Difference]: Without dead ends: 343 [2024-10-24 06:58:22,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 234 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:58:22,370 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 58 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:22,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 171 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:58:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-24 06:58:22,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2024-10-24 06:58:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 248 states have internal predecessors, (332), 70 states have call successors, (70), 18 states have call predecessors, (70), 18 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 06:58:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 472 transitions. [2024-10-24 06:58:22,414 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 472 transitions. Word has length 104 [2024-10-24 06:58:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:22,414 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 472 transitions. [2024-10-24 06:58:22,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 06:58:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 472 transitions. [2024-10-24 06:58:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 06:58:22,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:22,417 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:22,437 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-24 06:58:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:22,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1222495023, now seen corresponding path program 1 times [2024-10-24 06:58:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741101861] [2024-10-24 06:58:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:58:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:58:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:58:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 06:58:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:58:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:58:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:58:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:58:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:58:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:58:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:58:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:58:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:58:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:58:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:58:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 06:58:23,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:58:23,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741101861] [2024-10-24 06:58:23,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741101861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:58:23,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146852117] [2024-10-24 06:58:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:23,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:23,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:58:23,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 06:58:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:24,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 06:58:24,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:58:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 292 proven. 30 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-24 06:58:25,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:58:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-10-24 06:58:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146852117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:58:27,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:58:27,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 17] total 37 [2024-10-24 06:58:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933194301] [2024-10-24 06:58:27,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:58:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-24 06:58:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:58:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-24 06:58:27,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 06:58:27,850 INFO L87 Difference]: Start difference. First operand 335 states and 472 transitions. Second operand has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 10 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-10-24 06:58:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:38,124 INFO L93 Difference]: Finished difference Result 1230 states and 1633 transitions. [2024-10-24 06:58:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-10-24 06:58:38,125 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 10 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) Word has length 105 [2024-10-24 06:58:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:38,134 INFO L225 Difference]: With dead ends: 1230 [2024-10-24 06:58:38,135 INFO L226 Difference]: Without dead ends: 896 [2024-10-24 06:58:38,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4651 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2774, Invalid=10798, Unknown=0, NotChecked=0, Total=13572 [2024-10-24 06:58:38,140 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1603 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:38,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1364 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 06:58:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-24 06:58:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 530. [2024-10-24 06:58:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 378 states have (on average 1.253968253968254) internal successors, (474), 382 states have internal predecessors, (474), 109 states have call successors, (109), 42 states have call predecessors, (109), 42 states have return successors, (109), 105 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-24 06:58:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 692 transitions. [2024-10-24 06:58:38,252 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 692 transitions. Word has length 105 [2024-10-24 06:58:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:38,265 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 692 transitions. [2024-10-24 06:58:38,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 10 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-10-24 06:58:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 692 transitions. [2024-10-24 06:58:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 06:58:38,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:38,267 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:38,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 06:58:38,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 06:58:38,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1792608595, now seen corresponding path program 1 times [2024-10-24 06:58:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:58:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039248926] [2024-10-24 06:58:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:58:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:58:38,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [166469794] [2024-10-24 06:58:38,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:38,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:38,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:38,625 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:58:38,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 06:58:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:58:39,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:58:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:58:39,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:58:39,514 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:58:39,515 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:58:39,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:58:39,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:58:39,720 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:58:39,808 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:58:39,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:58:39 BoogieIcfgContainer [2024-10-24 06:58:39,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:58:39,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:58:39,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:58:39,813 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:58:39,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:18" (3/4) ... [2024-10-24 06:58:39,815 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:58:39,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:58:39,818 INFO L158 Benchmark]: Toolchain (without parser) took 22837.23ms. Allocated memory was 146.8MB in the beginning and 270.5MB in the end (delta: 123.7MB). Free memory was 79.1MB in the beginning and 150.4MB in the end (delta: -71.3MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-10-24 06:58:39,818 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:58:39,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.46ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 118.6MB in the end (delta: -39.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-24 06:58:39,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 146.8MB. Free memory was 118.6MB in the beginning and 113.9MB in the end (delta: 4.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:58:39,819 INFO L158 Benchmark]: Boogie Preprocessor took 85.75ms. Allocated memory is still 146.8MB. Free memory was 113.9MB in the beginning and 108.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 06:58:39,819 INFO L158 Benchmark]: RCFGBuilder took 586.58ms. Allocated memory is still 146.8MB. Free memory was 108.2MB in the beginning and 77.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 06:58:39,819 INFO L158 Benchmark]: TraceAbstraction took 21616.50ms. Allocated memory was 146.8MB in the beginning and 270.5MB in the end (delta: 123.7MB). Free memory was 76.7MB in the beginning and 151.5MB in the end (delta: -74.8MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2024-10-24 06:58:39,820 INFO L158 Benchmark]: Witness Printer took 5.12ms. Allocated memory is still 270.5MB. Free memory was 151.5MB in the beginning and 150.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:58:39,821 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.18ms. Allocated memory is still 107.0MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.46ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 118.6MB in the end (delta: -39.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 146.8MB. Free memory was 118.6MB in the beginning and 113.9MB in the end (delta: 4.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.75ms. Allocated memory is still 146.8MB. Free memory was 113.9MB in the beginning and 108.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 586.58ms. Allocated memory is still 146.8MB. Free memory was 108.2MB in the beginning and 77.7MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21616.50ms. Allocated memory was 146.8MB in the beginning and 270.5MB in the end (delta: 123.7MB). Free memory was 76.7MB in the beginning and 151.5MB in the end (delta: -74.8MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * Witness Printer took 5.12ms. Allocated memory is still 270.5MB. Free memory was 151.5MB in the beginning and 150.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_31 = 1; [L40] unsigned long int var_1_33 = 2; [L41] unsigned short int var_1_34 = 0; [L42] signed short int var_1_35 = -10; [L43] unsigned char var_1_40 = 2; [L44] unsigned short int var_1_42 = 8; [L45] unsigned long int var_1_44 = 1249494912; [L46] double last_1_var_1_1 = 5.05; [L47] unsigned short int last_1_var_1_9 = 1; [L48] unsigned long int last_1_var_1_11 = 8; [L49] unsigned char last_1_var_1_14 = 32; [L50] unsigned char last_1_var_1_20 = 0; [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_11 = var_1_11 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_20 = var_1_20 [L164] RET updateLastVariables() [L165] CALL updateVariables() [L124] var_1_6 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L125] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L126] var_1_7 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L127] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L128] var_1_8 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L129] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L130] var_1_13 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L131] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L134] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L136] var_1_16 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L139] var_1_17 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L142] var_1_19 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L145] var_1_44 = __VERIFIER_nondet_ulong() [L146] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L146] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] COND TRUE \read(var_1_13) [L55] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L59] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L68] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L69] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L73] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L74] COND FALSE !(var_1_18 >= stepLocal_0) [L77] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L79] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L80] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L82] COND TRUE \read(var_1_20) [L83] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L85] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L86] COND FALSE !(((((var_1_9) < (var_1_14)) ? (var_1_9) : (var_1_14))) > var_1_18) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L89] COND FALSE !((var_1_15 <= var_1_9) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L100] COND TRUE var_1_17 > (- var_1_17) [L101] var_1_31 = (var_1_13 && var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L103] var_1_33 = var_1_15 [L104] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L105] COND TRUE ((var_1_7 - var_1_6) + var_1_6) == var_1_8 [L106] var_1_35 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L108] COND TRUE var_1_18 >= (~ var_1_19) [L109] var_1_40 = var_1_16 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L111] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L112] COND FALSE !(var_1_19 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2096 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2078 mSDsluCounter, 2453 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1869 mSDsCounter, 695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2585 IncrementalHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 695 mSolverCounterUnsat, 584 mSDtfsCounter, 2585 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 616 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4652 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=6, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 522 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1044 NumberOfCodeBlocks, 1044 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1033 ConstructedInterpolants, 0 QuantifiedInterpolants, 6186 SizeOfPredicates, 8 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 4023/4200 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-24 06:58:39,948 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_fillercodestructure_filler-pe-ci_file-70.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 c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:58:42,043 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:58:42,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:58:42,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:58:42,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:58:42,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:58:42,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:58:42,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:58:42,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:58:42,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:58:42,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:58:42,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:58:42,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:58:42,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:58:42,168 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:58:42,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:58:42,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:58:42,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:58:42,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:58:42,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:58:42,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:58:42,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:58:42,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:58:42,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:58:42,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:58:42,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:58:42,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:58:42,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:58:42,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:58:42,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:58:42,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:58:42,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:58:42,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:58:42,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:58:42,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:58:42,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:58:42,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:58:42,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:58:42,187 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:58:42,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:58:42,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:58:42,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:58:42,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:58:42,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:58:42,189 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:58:42,189 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 -> c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c [2024-10-24 06:58:42,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:58:42,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:58:42,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:58:42,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:58:42,587 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:58:42,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-24 06:58:44,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:58:44,399 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:58:44,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-24 06:58:44,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74bd9627/afdbf149a09b4f7383b6502988815ccb/FLAG2969ec829 [2024-10-24 06:58:44,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a74bd9627/afdbf149a09b4f7383b6502988815ccb [2024-10-24 06:58:44,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:58:44,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:58:44,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:58:44,439 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:58:44,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:58:44,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f781a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44, skipping insertion in model container [2024-10-24 06:58:44,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:58:44,660 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_fillercodestructure_filler-pe-ci_file-70.i[919,932] [2024-10-24 06:58:44,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:58:44,754 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:58:44,766 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_fillercodestructure_filler-pe-ci_file-70.i[919,932] [2024-10-24 06:58:44,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:58:44,840 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:58:44,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44 WrapperNode [2024-10-24 06:58:44,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:58:44,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:58:44,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:58:44,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:58:44,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,897 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-24 06:58:44,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:58:44,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:58:44,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:58:44,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:58:44,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,932 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-24 06:58:44,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:58:44,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:58:44,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:58:44,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:58:44,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (1/1) ... [2024-10-24 06:58:44,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:58:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:58:45,007 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-24 06:58:45,010 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-24 06:58:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:58:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:58:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:58:45,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:58:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:58:45,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:58:45,162 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:58:45,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:58:49,760 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 06:58:49,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:58:49,834 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:58:49,838 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:58:49,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:49 BoogieIcfgContainer [2024-10-24 06:58:49,839 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:58:49,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:58:49,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:58:49,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:58:49,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:58:44" (1/3) ... [2024-10-24 06:58:49,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4c75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:58:49, skipping insertion in model container [2024-10-24 06:58:49,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:58:44" (2/3) ... [2024-10-24 06:58:49,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4c75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:58:49, skipping insertion in model container [2024-10-24 06:58:49,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:58:49" (3/3) ... [2024-10-24 06:58:49,850 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-24 06:58:49,870 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:58:49,870 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:58:49,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:58:49,937 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;@7d3fb9a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:58:49,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:58:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 40 states have (on average 1.575) internal successors, (63), 41 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 06:58:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 06:58:49,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:49,957 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:49,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:49,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:49,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2009444281, now seen corresponding path program 1 times [2024-10-24 06:58:49,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:58:49,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033831556] [2024-10-24 06:58:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:49,974 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-24 06:58:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:58:49,977 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-24 06:58:49,996 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-24 06:58:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:50,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 06:58:50,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:58:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-24 06:58:53,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:58:53,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:58:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033831556] [2024-10-24 06:58:53,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033831556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:58:53,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784460425] [2024-10-24 06:58:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:53,893 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:58:53,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:58:53,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:58:53,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-10-24 06:58:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:54,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:58:54,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:58:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 06:58:54,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:58:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1784460425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:58:54,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:58:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-10-24 06:58:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942790606] [2024-10-24 06:58:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:58:54,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:58:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:58:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:58:54,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-24 06:58:54,478 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.575) internal successors, (63), 41 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:57,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:58:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:58:57,760 INFO L93 Difference]: Finished difference Result 147 states and 257 transitions. [2024-10-24 06:58:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:58:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-24 06:58:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:58:57,770 INFO L225 Difference]: With dead ends: 147 [2024-10-24 06:58:57,770 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 06:58:57,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-24 06:58:57,776 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:58:57,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 148 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 06:58:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 06:58:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-10-24 06:58:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 06:58:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-10-24 06:58:57,831 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 104 [2024-10-24 06:58:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:58:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-10-24 06:58:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:58:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-10-24 06:58:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 06:58:57,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:58:57,836 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:58:57,856 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-24 06:58:58,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-10-24 06:58:58,237 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 06:58:58,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:58:58,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:58:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 291378309, now seen corresponding path program 1 times [2024-10-24 06:58:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:58:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022213371] [2024-10-24 06:58:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:58:58,240 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-24 06:58:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:58:58,242 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-24 06:58:58,243 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-24 06:58:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:58:58,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:58:58,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:58:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-24 06:58:59,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:58:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-24 06:58:59,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:58:59,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022213371] [2024-10-24 06:58:59,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022213371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:58:59,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:58:59,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 06:58:59,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099670782] [2024-10-24 06:58:59,662 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:58:59,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 06:58:59,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:58:59,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 06:58:59,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:58:59,666 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 06:59:02,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:59:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:59:03,736 INFO L93 Difference]: Finished difference Result 152 states and 224 transitions. [2024-10-24 06:59:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 06:59:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 104 [2024-10-24 06:59:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:59:03,778 INFO L225 Difference]: With dead ends: 152 [2024-10-24 06:59:03,778 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 06:59:03,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 06:59:03,780 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 06:59:03,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 142 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 06:59:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 06:59:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-24 06:59:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 06:59:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-10-24 06:59:03,792 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 104 [2024-10-24 06:59:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:59:03,792 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-10-24 06:59:03,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-24 06:59:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-10-24 06:59:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 06:59:03,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:59:03,796 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:59:03,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 06:59:03,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-24 06:59:03,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:59:03,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:59:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2116866311, now seen corresponding path program 1 times [2024-10-24 06:59:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:59:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897710989] [2024-10-24 06:59:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:59:04,001 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-24 06:59:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:59:04,004 INFO L229 MonitoredProcess]: Starting monitored process 5 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-24 06:59:04,006 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 (5)] Waiting until timeout for monitored process [2024-10-24 06:59:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:59:04,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 06:59:04,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:59:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-24 06:59:06,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:59:13,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:59:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897710989] [2024-10-24 06:59:13,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897710989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:59:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1542902232] [2024-10-24 06:59:13,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:59:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:59:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:59:13,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:59:13,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 06:59:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:59:13,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:59:13,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:59:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 06:59:14,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:59:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1542902232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:59:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:59:14,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-24 06:59:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487767504] [2024-10-24 06:59:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:59:14,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:59:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:59:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:59:14,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2024-10-24 06:59:14,696 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:59:17,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:59:20,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:59:23,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 06:59:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:59:24,326 INFO L93 Difference]: Finished difference Result 247 states and 347 transitions. [2024-10-24 06:59:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:59:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-10-24 06:59:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:59:24,329 INFO L225 Difference]: With dead ends: 247 [2024-10-24 06:59:24,329 INFO L226 Difference]: Without dead ends: 184 [2024-10-24 06:59:24,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=47, Invalid=192, Unknown=1, NotChecked=0, Total=240 [2024-10-24 06:59:24,332 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 100 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-10-24 06:59:24,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 267 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-10-24 06:59:24,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-24 06:59:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 136. [2024-10-24 06:59:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 06:59:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 195 transitions. [2024-10-24 06:59:24,367 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 195 transitions. Word has length 105 [2024-10-24 06:59:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:59:24,369 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 195 transitions. [2024-10-24 06:59:24,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 06:59:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 195 transitions. [2024-10-24 06:59:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 06:59:24,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:59:24,372 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 06:59:24,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:59:24,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-24 06:59:24,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 06:59:24,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:59:24,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:59:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1477036407, now seen corresponding path program 1 times [2024-10-24 06:59:24,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:59:24,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498863371] [2024-10-24 06:59:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:59:24,774 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-24 06:59:24,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:59:24,776 INFO L229 MonitoredProcess]: Starting monitored process 7 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-24 06:59:24,777 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 (7)] Waiting until timeout for monitored process [2024-10-24 06:59:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:59:25,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 06:59:25,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:59:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-24 06:59:27,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:59:28,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:59:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498863371] [2024-10-24 06:59:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498863371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:59:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [127665909] [2024-10-24 06:59:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:59:28,083 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:59:28,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:59:28,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 06:59:28,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-24 06:59:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:59:28,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 06:59:28,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:59:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-24 06:59:31,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:59:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [127665909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:59:31,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:59:31,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-24 06:59:31,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120367615] [2024-10-24 06:59:31,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:59:31,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 06:59:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:59:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 06:59:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 06:59:31,690 INFO L87 Difference]: Start difference. First operand 136 states and 195 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)