./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-pr-ci_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-pr-ci_file-40.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 d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:36:57,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:36:57,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:36:57,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:36:57,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:36:57,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:36:57,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:36:57,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:36:57,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:36:57,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:36:57,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:36:57,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:36:57,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:36:57,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:36:57,867 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:36:57,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:36:57,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:36:57,873 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:36:57,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:36:57,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:36:57,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:36:57,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:36:57,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:36:57,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:36:57,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:36:57,879 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:36:57,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:36:57,880 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:36:57,880 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:36:57,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:36:57,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:36:57,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:36:57,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:36:57,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:36:57,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:36:57,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:36:57,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:36:57,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:36:57,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:36:57,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:36:57,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:36:57,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:36:57,884 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 -> d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 [2024-10-14 09:36:58,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:36:58,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:36:58,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:36:58,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:36:58,193 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:36:58,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-10-14 09:36:59,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:36:59,937 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:36:59,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-10-14 09:36:59,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a561efe/b6ad5e8227cd4976bf0428cc51feeda8/FLAG55f6ffdde [2024-10-14 09:36:59,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77a561efe/b6ad5e8227cd4976bf0428cc51feeda8 [2024-10-14 09:36:59,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:36:59,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:36:59,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:36:59,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:36:59,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:36:59,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:36:59" (1/1) ... [2024-10-14 09:36:59,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38056957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:36:59, skipping insertion in model container [2024-10-14 09:36:59,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:36:59" (1/1) ... [2024-10-14 09:37:00,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:37:00,158 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-pr-ci_file-40.i[919,932] [2024-10-14 09:37:00,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:37:00,234 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:37:00,248 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-pr-ci_file-40.i[919,932] [2024-10-14 09:37:00,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:37:00,311 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:37:00,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00 WrapperNode [2024-10-14 09:37:00,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:37:00,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:37:00,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:37:00,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:37:00,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,386 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-14 09:37:00,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:37:00,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:37:00,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:37:00,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:37:00,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,432 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-14 09:37:00,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:37:00,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:37:00,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:37:00,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:37:00,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (1/1) ... [2024-10-14 09:37:00,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:37:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:37:00,512 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-14 09:37:00,515 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-14 09:37:00,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:37:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:37:00,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:37:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:37:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:37:00,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:37:00,664 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:37:00,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:37:01,109 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 09:37:01,110 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:37:01,170 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:37:01,171 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:37:01,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:01 BoogieIcfgContainer [2024-10-14 09:37:01,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:37:01,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:37:01,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:37:01,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:37:01,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:36:59" (1/3) ... [2024-10-14 09:37:01,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7d420f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:37:01, skipping insertion in model container [2024-10-14 09:37:01,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:00" (2/3) ... [2024-10-14 09:37:01,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c7d420f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:37:01, skipping insertion in model container [2024-10-14 09:37:01,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:01" (3/3) ... [2024-10-14 09:37:01,182 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-10-14 09:37:01,199 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:37:01,199 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:37:01,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:37:01,273 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;@22c99757, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:37:01,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:37:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 48 states have internal predecessors, (72), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 09:37:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 09:37:01,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:01,293 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:01,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:01,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1647714139, now seen corresponding path program 1 times [2024-10-14 09:37:01,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:01,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529087462] [2024-10-14 09:37:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:01,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 09:37:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 09:37:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:37:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:37:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:37:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:01,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:01,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529087462] [2024-10-14 09:37:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529087462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:01,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:01,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:37:01,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174699162] [2024-10-14 09:37:01,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:01,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:37:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:37:01,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:37:01,789 INFO L87 Difference]: Start difference. First operand has 68 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 48 states have internal predecessors, (72), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:01,835 INFO L93 Difference]: Finished difference Result 133 states and 232 transitions. [2024-10-14 09:37:01,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:37:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 125 [2024-10-14 09:37:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:01,848 INFO L225 Difference]: With dead ends: 133 [2024-10-14 09:37:01,848 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 09:37:01,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-14 09:37:01,857 INFO L432 NwaCegarLoop]: 99 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, 99 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-14 09:37:01,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:37:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 09:37:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 09:37:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 09:37:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-14 09:37:01,919 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 125 [2024-10-14 09:37:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:01,921 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-14 09:37:01,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-14 09:37:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 09:37:01,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:01,927 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:01,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:37:01,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:01,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1717509666, now seen corresponding path program 1 times [2024-10-14 09:37:01,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:01,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965080526] [2024-10-14 09:37:01,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 09:37:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 09:37:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:37:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:37:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:37:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965080526] [2024-10-14 09:37:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965080526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:37:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082274535] [2024-10-14 09:37:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:02,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:37:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:37:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:37:02,398 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:02,641 INFO L93 Difference]: Finished difference Result 173 states and 264 transitions. [2024-10-14 09:37:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:37:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-14 09:37:02,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:02,645 INFO L225 Difference]: With dead ends: 173 [2024-10-14 09:37:02,646 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 09:37:02,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:37:02,651 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 54 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:02,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 279 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:37:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 09:37:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-10-14 09:37:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:37:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 160 transitions. [2024-10-14 09:37:02,686 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 160 transitions. Word has length 126 [2024-10-14 09:37:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:02,687 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 160 transitions. [2024-10-14 09:37:02,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 160 transitions. [2024-10-14 09:37:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 09:37:02,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:02,690 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:02,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:37:02,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:02,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:02,693 INFO L85 PathProgramCache]: Analyzing trace with hash 129161764, now seen corresponding path program 1 times [2024-10-14 09:37:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600022828] [2024-10-14 09:37:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 09:37:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 09:37:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:37:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:37:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:37:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:02,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:02,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600022828] [2024-10-14 09:37:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600022828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:37:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998774129] [2024-10-14 09:37:02,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:37:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:37:02,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:37:02,969 INFO L87 Difference]: Start difference. First operand 105 states and 160 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:03,010 INFO L93 Difference]: Finished difference Result 209 states and 319 transitions. [2024-10-14 09:37:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:37:03,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-14 09:37:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:03,019 INFO L225 Difference]: With dead ends: 209 [2024-10-14 09:37:03,020 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 09:37:03,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-14 09:37:03,022 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:03,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:37:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 09:37:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 09:37:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 73 states have internal predecessors, (98), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:37:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-10-14 09:37:03,044 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 126 [2024-10-14 09:37:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:03,044 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-10-14 09:37:03,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-10-14 09:37:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 09:37:03,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:03,052 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:03,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:37:03,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:03,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:03,054 INFO L85 PathProgramCache]: Analyzing trace with hash 830226342, now seen corresponding path program 1 times [2024-10-14 09:37:03,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:03,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93866794] [2024-10-14 09:37:03,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 09:37:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 09:37:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:37:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:37:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:37:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:04,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93866794] [2024-10-14 09:37:04,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93866794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:04,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:04,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 09:37:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510021195] [2024-10-14 09:37:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:04,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 09:37:04,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 09:37:04,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:37:04,177 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:05,157 INFO L93 Difference]: Finished difference Result 475 states and 700 transitions. [2024-10-14 09:37:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:37:05,158 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2024-10-14 09:37:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:05,161 INFO L225 Difference]: With dead ends: 475 [2024-10-14 09:37:05,163 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 09:37:05,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-14 09:37:05,168 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 339 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:05,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 333 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 09:37:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 09:37:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 227. [2024-10-14 09:37:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 157 states have internal predecessors, (205), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 09:37:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 337 transitions. [2024-10-14 09:37:05,250 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 337 transitions. Word has length 126 [2024-10-14 09:37:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 337 transitions. [2024-10-14 09:37:05,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 337 transitions. [2024-10-14 09:37:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 09:37:05,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:05,253 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:05,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:37:05,254 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:05,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:05,254 INFO L85 PathProgramCache]: Analyzing trace with hash 830285924, now seen corresponding path program 1 times [2024-10-14 09:37:05,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:05,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025953676] [2024-10-14 09:37:05,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:05,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 09:37:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 09:37:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:37:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:37:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:37:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-14 09:37:05,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:05,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025953676] [2024-10-14 09:37:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025953676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:37:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786582400] [2024-10-14 09:37:05,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:05,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:37:05,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:37:05,603 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-14 09:37:05,607 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-14 09:37:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:05,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:37:05,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:37:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 09:37:05,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:37:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-14 09:37:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786582400] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:37:06,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:37:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 09:37:06,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473647485] [2024-10-14 09:37:06,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:37:06,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:37:06,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:37:06,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:37:06,150 INFO L87 Difference]: Start difference. First operand 227 states and 337 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 09:37:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:06,343 INFO L93 Difference]: Finished difference Result 355 states and 513 transitions. [2024-10-14 09:37:06,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:37:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 126 [2024-10-14 09:37:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:06,347 INFO L225 Difference]: With dead ends: 355 [2024-10-14 09:37:06,348 INFO L226 Difference]: Without dead ends: 172 [2024-10-14 09:37:06,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 283 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:37:06,350 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 92 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:06,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 160 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:37:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-14 09:37:06,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2024-10-14 09:37:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 96 states have internal predecessors, (114), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 09:37:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 210 transitions. [2024-10-14 09:37:06,385 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 210 transitions. Word has length 126 [2024-10-14 09:37:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:06,386 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 210 transitions. [2024-10-14 09:37:06,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 09:37:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2024-10-14 09:37:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 09:37:06,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:06,388 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:06,408 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-14 09:37:06,589 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-14 09:37:06,589 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:06,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1879785754, now seen corresponding path program 1 times [2024-10-14 09:37:06,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:06,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776035383] [2024-10-14 09:37:06,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:06,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 09:37:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 09:37:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:37:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:37:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:37:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:07,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:07,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776035383] [2024-10-14 09:37:07,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776035383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:07,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 09:37:07,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837331692] [2024-10-14 09:37:07,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:07,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:37:07,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:07,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:37:07,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:37:07,243 INFO L87 Difference]: Start difference. First operand 150 states and 210 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:07,880 INFO L93 Difference]: Finished difference Result 382 states and 521 transitions. [2024-10-14 09:37:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:37:07,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2024-10-14 09:37:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:07,884 INFO L225 Difference]: With dead ends: 382 [2024-10-14 09:37:07,884 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 09:37:07,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:37:07,886 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:07,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 159 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:37:07,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 09:37:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 125. [2024-10-14 09:37:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.25) internal successors, (110), 89 states have internal predecessors, (110), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:37:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 170 transitions. [2024-10-14 09:37:07,934 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 170 transitions. Word has length 126 [2024-10-14 09:37:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 170 transitions. [2024-10-14 09:37:07,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 170 transitions. [2024-10-14 09:37:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 09:37:07,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:07,936 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:07,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:37:07,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:07,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1879726172, now seen corresponding path program 1 times [2024-10-14 09:37:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:07,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398270452] [2024-10-14 09:37:07,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:07,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:37:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:37:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 09:37:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:37:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 09:37:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:37:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 09:37:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:37:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 09:37:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:37:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 09:37:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:37:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:37:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:37:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:37:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:37:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:37:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 09:37:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:08,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:37:08,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398270452] [2024-10-14 09:37:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398270452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:08,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:37:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946066097] [2024-10-14 09:37:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:08,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:37:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:37:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:37:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:37:08,200 INFO L87 Difference]: Start difference. First operand 125 states and 170 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:08,345 INFO L93 Difference]: Finished difference Result 337 states and 461 transitions. [2024-10-14 09:37:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:37:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-10-14 09:37:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:08,347 INFO L225 Difference]: With dead ends: 337 [2024-10-14 09:37:08,347 INFO L226 Difference]: Without dead ends: 205 [2024-10-14 09:37:08,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:37:08,349 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 62 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:08,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 274 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:37:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-14 09:37:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 126. [2024-10-14 09:37:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.247191011235955) internal successors, (111), 90 states have internal predecessors, (111), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:37:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 171 transitions. [2024-10-14 09:37:08,393 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 171 transitions. Word has length 126 [2024-10-14 09:37:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:08,394 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 171 transitions. [2024-10-14 09:37:08,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 171 transitions. [2024-10-14 09:37:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 09:37:08,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:08,396 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:08,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:37:08,397 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:08,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1457024346, now seen corresponding path program 1 times [2024-10-14 09:37:08,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:37:08,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510078615] [2024-10-14 09:37:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:08,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:37:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:37:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541773829] [2024-10-14 09:37:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:08,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:37:08,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:37:08,466 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-14 09:37:08,485 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-14 09:37:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:37:08,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:37:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:37:08,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:37:08,757 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:37:08,759 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:37:08,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 09:37:08,961 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,SelfDestructingSolverStorable7 [2024-10-14 09:37:08,966 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:37:09,089 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:37:09,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:37:09 BoogieIcfgContainer [2024-10-14 09:37:09,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:37:09,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:37:09,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:37:09,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:37:09,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:01" (3/4) ... [2024-10-14 09:37:09,099 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:37:09,101 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:37:09,102 INFO L158 Benchmark]: Toolchain (without parser) took 9135.49ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 121.7MB in the beginning and 162.3MB in the end (delta: -40.7MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2024-10-14 09:37:09,102 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:37:09,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.43ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 105.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:37:09,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.15ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 100.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:37:09,103 INFO L158 Benchmark]: Boogie Preprocessor took 85.96ms. Allocated memory is still 151.0MB. Free memory was 100.5MB in the beginning and 92.7MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 09:37:09,103 INFO L158 Benchmark]: RCFGBuilder took 697.36ms. Allocated memory is still 151.0MB. Free memory was 92.7MB in the beginning and 97.2MB in the end (delta: -4.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 09:37:09,103 INFO L158 Benchmark]: TraceAbstraction took 7921.27ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 96.3MB in the beginning and 163.4MB in the end (delta: -67.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-10-14 09:37:09,103 INFO L158 Benchmark]: Witness Printer took 5.36ms. Allocated memory is still 232.8MB. Free memory was 163.4MB in the beginning and 162.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:37:09,105 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.19ms. Allocated memory is still 151.0MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.43ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 105.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.15ms. Allocated memory is still 151.0MB. Free memory was 105.2MB in the beginning and 100.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.96ms. Allocated memory is still 151.0MB. Free memory was 100.5MB in the beginning and 92.7MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 697.36ms. Allocated memory is still 151.0MB. Free memory was 92.7MB in the beginning and 97.2MB in the end (delta: -4.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7921.27ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 96.3MB in the beginning and 163.4MB in the end (delta: -67.1MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 5.36ms. Allocated memory is still 232.8MB. Free memory was 163.4MB in the beginning and 162.3MB 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 someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned long int var_1_34 = 50; [L42] double var_1_35 = 31.1; [L43] unsigned long int var_1_37 = 64; [L44] signed long int var_1_38 = 8; [L45] float var_1_39 = 200.6; [L46] unsigned short int var_1_40 = 2; [L47] signed char var_1_42 = -4; [L48] double var_1_43 = 2.75; [L49] signed char var_1_45 = 32; [L50] unsigned long int var_1_46 = 32; [L51] signed long int var_1_47 = -256; [L52] unsigned char last_1_var_1_9 = 1; [L53] float last_1_var_1_24 = 128.5; [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_24 = var_1_24 [L167] RET updateLastVariables() [L168] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L128] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L129] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L130] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L131] var_1_8 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L134] var_1_10 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L143] var_1_20 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L145] var_1_28 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L148] var_1_29 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L151] var_1_39 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L168] RET updateVariables() [L169] CALL step() [L57] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L64] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L66] COND TRUE var_1_11 || var_1_10 [L67] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L69] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L70] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L71] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L73] COND FALSE !(var_1_9 && var_1_9) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L76] var_1_35 = var_1_20 [L77] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L78] COND FALSE !((var_1_11 && var_1_9) && (var_1_12 > var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L81] EXPR var_1_8 | var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L81] COND FALSE !(var_1_28 > (var_1_8 | var_1_12)) [L84] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L87] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L89] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L90] COND FALSE !((((((var_1_20 / var_1_39)) > (var_1_24)) ? ((var_1_20 / var_1_39)) : (var_1_24))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L95] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L96] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L99] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L103] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L104] var_1_46 = var_1_15 [L105] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L106] COND FALSE !(var_1_28 > var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L111] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L112] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L113] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L117] COND FALSE !(var_1_12 > ((var_1_29 >> 1) + var_1_15)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L120] var_1_47 = var_1_4 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=1, var_1_4=1, var_1_8=0, var_1_9=0] [L121] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=0, var_1_47=1, var_1_4=1, var_1_8=0, var_1_9=0] [L124] var_1_45 = var_1_28 [L169] RET step() [L170] CALL, EXPR property() [L160-L161] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=1, var_1_4=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=1, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=1, var_1_4=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 741 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 1495 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 817 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 678 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 540 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=4, InterpolantAutomatonStates: 37, 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, 7 MinimizatonAttempts, 395 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1259 NumberOfCodeBlocks, 1259 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1124 ConstructedInterpolants, 0 QuantifiedInterpolants, 3311 SizeOfPredicates, 2 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 5427/5508 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-14 09:37:09,143 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-pr-ci_file-40.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 d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:37:11,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:37:11,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:37:11,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:37:11,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:37:11,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:37:11,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:37:11,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:37:11,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:37:11,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:37:11,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:37:11,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:37:11,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:37:11,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:37:11,478 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:37:11,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:37:11,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:37:11,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:37:11,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:37:11,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:37:11,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:37:11,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:37:11,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:37:11,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:37:11,482 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:37:11,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:37:11,482 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:37:11,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:37:11,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:37:11,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:37:11,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:37:11,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:37:11,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:37:11,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:37:11,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:37:11,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:37:11,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:37:11,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:37:11,486 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:37:11,487 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:37:11,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:37:11,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:37:11,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:37:11,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:37:11,492 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:37:11,492 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 -> d3471d5ae5f1099f9615a7bd6584823d63dd4d8febcf8f5494b59eb9e166fe71 [2024-10-14 09:37:11,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:37:11,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:37:11,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:37:11,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:37:11,858 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:37:11,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-10-14 09:37:13,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:37:13,727 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:37:13,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-10-14 09:37:13,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171a0c2fc/132e352abd7349c7b5c7464d42f6bff2/FLAGcf04aaae1 [2024-10-14 09:37:13,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171a0c2fc/132e352abd7349c7b5c7464d42f6bff2 [2024-10-14 09:37:13,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:37:13,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:37:13,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:37:13,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:37:13,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:37:13,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:37:13" (1/1) ... [2024-10-14 09:37:13,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e81f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:13, skipping insertion in model container [2024-10-14 09:37:13,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:37:13" (1/1) ... [2024-10-14 09:37:13,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:37:13,970 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-pr-ci_file-40.i[919,932] [2024-10-14 09:37:14,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:37:14,095 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:37:14,108 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-pr-ci_file-40.i[919,932] [2024-10-14 09:37:14,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:37:14,199 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:37:14,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14 WrapperNode [2024-10-14 09:37:14,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:37:14,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:37:14,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:37:14,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:37:14,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,269 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-14 09:37:14,276 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:37:14,277 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:37:14,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:37:14,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:37:14,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,323 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-14 09:37:14,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:37:14,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:37:14,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:37:14,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:37:14,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (1/1) ... [2024-10-14 09:37:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:37:14,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:37:14,409 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-14 09:37:14,413 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-14 09:37:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:37:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:37:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:37:14,458 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:37:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:37:14,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:37:14,564 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:37:14,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:37:17,505 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 09:37:17,506 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:37:17,568 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:37:17,568 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:37:17,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:17 BoogieIcfgContainer [2024-10-14 09:37:17,569 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:37:17,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:37:17,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:37:17,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:37:17,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:37:13" (1/3) ... [2024-10-14 09:37:17,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fed4e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:37:17, skipping insertion in model container [2024-10-14 09:37:17,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:37:14" (2/3) ... [2024-10-14 09:37:17,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fed4e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:37:17, skipping insertion in model container [2024-10-14 09:37:17,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:37:17" (3/3) ... [2024-10-14 09:37:17,579 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-40.i [2024-10-14 09:37:17,597 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:37:17,598 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:37:17,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:37:17,686 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;@52f90f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:37:17,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:37:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 45 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 09:37:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 09:37:17,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:17,708 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:17,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:17,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash 421686399, now seen corresponding path program 1 times [2024-10-14 09:37:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:37:17,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023703758] [2024-10-14 09:37:17,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:17,734 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-14 09:37:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:37:17,739 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-14 09:37:17,740 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-14 09:37:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:18,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:37:18,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:37:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-14 09:37:18,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:37:18,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:37:18,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023703758] [2024-10-14 09:37:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023703758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:18,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:18,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:37:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679404183] [2024-10-14 09:37:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:18,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:37:18,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:37:18,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:37:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:37:18,315 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 45 states have internal predecessors, (67), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:18,650 INFO L93 Difference]: Finished difference Result 127 states and 222 transitions. [2024-10-14 09:37:18,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:37:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-10-14 09:37:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:18,668 INFO L225 Difference]: With dead ends: 127 [2024-10-14 09:37:18,669 INFO L226 Difference]: Without dead ends: 63 [2024-10-14 09:37:18,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-14 09:37:18,676 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:18,677 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.3s Time] [2024-10-14 09:37:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-14 09:37:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-14 09:37:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 43 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 09:37:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-14 09:37:18,734 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 124 [2024-10-14 09:37:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-14 09:37:18,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 09:37:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-14 09:37:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 09:37:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:18,742 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:18,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:37:18,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:37:18,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 286507070, now seen corresponding path program 1 times [2024-10-14 09:37:18,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:37:18,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772225493] [2024-10-14 09:37:18,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:18,948 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-14 09:37:18,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:37:18,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:37:18,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 09:37:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:19,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:37:19,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:37:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 09:37:19,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:37:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-14 09:37:20,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:37:20,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772225493] [2024-10-14 09:37:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772225493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:37:20,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:37:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-14 09:37:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985248453] [2024-10-14 09:37:20,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:37:20,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:37:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:37:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:37:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:37:20,335 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 09:37:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:21,975 INFO L93 Difference]: Finished difference Result 199 states and 295 transitions. [2024-10-14 09:37:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 09:37:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 125 [2024-10-14 09:37:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:21,979 INFO L225 Difference]: With dead ends: 199 [2024-10-14 09:37:21,979 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 09:37:21,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:37:21,981 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 215 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:21,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 253 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 09:37:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 09:37:22,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2024-10-14 09:37:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 09:37:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2024-10-14 09:37:22,005 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 125 [2024-10-14 09:37:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:22,007 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2024-10-14 09:37:22,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-14 09:37:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-10-14 09:37:22,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 09:37:22,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:22,010 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:22,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 09:37:22,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:37:22,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:22,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 748612856, now seen corresponding path program 1 times [2024-10-14 09:37:22,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:37:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054768691] [2024-10-14 09:37:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:22,218 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-14 09:37:22,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:37:22,221 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-14 09:37:22,222 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-14 09:37:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:22,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 09:37:22,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:37:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:22,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:37:22,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:37:22,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054768691] [2024-10-14 09:37:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054768691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:37:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352244544] [2024-10-14 09:37:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:37:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:37:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:37:22,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:37:22,580 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:22,740 INFO L93 Difference]: Finished difference Result 253 states and 365 transitions. [2024-10-14 09:37:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:37:22,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-14 09:37:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:22,756 INFO L225 Difference]: With dead ends: 253 [2024-10-14 09:37:22,756 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 09:37:22,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 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-14 09:37:22,759 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:22,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:37:22,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 09:37:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-14 09:37:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 86 states have internal predecessors, (109), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 09:37:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 181 transitions. [2024-10-14 09:37:22,778 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 181 transitions. Word has length 125 [2024-10-14 09:37:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:22,778 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 181 transitions. [2024-10-14 09:37:22,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:22,779 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 181 transitions. [2024-10-14 09:37:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 09:37:22,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:22,781 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:22,797 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 (4)] Ended with exit code 0 [2024-10-14 09:37:22,981 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-14 09:37:22,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:22,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:22,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1449677434, now seen corresponding path program 1 times [2024-10-14 09:37:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:37:22,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581285330] [2024-10-14 09:37:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:22,984 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-14 09:37:22,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:37:22,987 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-14 09:37:22,988 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-14 09:37:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:23,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:37:23,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:37:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 09:37:23,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:37:23,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:37:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581285330] [2024-10-14 09:37:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581285330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:37:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:37:23,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:37:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795734529] [2024-10-14 09:37:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:37:23,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:37:23,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:37:23,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:37:23,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:37:23,658 INFO L87 Difference]: Start difference. First operand 127 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:24,947 INFO L93 Difference]: Finished difference Result 394 states and 551 transitions. [2024-10-14 09:37:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:37:24,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-10-14 09:37:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:24,951 INFO L225 Difference]: With dead ends: 394 [2024-10-14 09:37:24,951 INFO L226 Difference]: Without dead ends: 268 [2024-10-14 09:37:24,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:37:24,953 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 160 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:24,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 239 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 09:37:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-14 09:37:24,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 176. [2024-10-14 09:37:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 113 states have (on average 1.2212389380530972) internal successors, (138), 114 states have internal predecessors, (138), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 09:37:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 246 transitions. [2024-10-14 09:37:24,985 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 246 transitions. Word has length 125 [2024-10-14 09:37:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:24,985 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 246 transitions. [2024-10-14 09:37:24,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-14 09:37:24,986 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 246 transitions. [2024-10-14 09:37:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 09:37:24,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:24,987 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:25,003 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-14 09:37:25,188 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 [2024-10-14 09:37:25,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1449737016, now seen corresponding path program 1 times [2024-10-14 09:37:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:37:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472187356] [2024-10-14 09:37:25,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:25,190 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-14 09:37:25,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:37:25,193 INFO L229 MonitoredProcess]: Starting monitored process 6 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-14 09:37:25,195 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 (6)] Waiting until timeout for monitored process [2024-10-14 09:37:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:25,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:37:25,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:37:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-10-14 09:37:26,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:37:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-14 09:37:26,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:37:26,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472187356] [2024-10-14 09:37:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472187356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:37:26,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:37:26,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-10-14 09:37:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455183606] [2024-10-14 09:37:26,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:37:26,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 09:37:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:37:26,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 09:37:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:37:26,694 INFO L87 Difference]: Start difference. First operand 176 states and 246 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:37:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:37:29,149 INFO L93 Difference]: Finished difference Result 444 states and 593 transitions. [2024-10-14 09:37:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 09:37:29,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 125 [2024-10-14 09:37:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:37:29,154 INFO L225 Difference]: With dead ends: 444 [2024-10-14 09:37:29,155 INFO L226 Difference]: Without dead ends: 304 [2024-10-14 09:37:29,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-10-14 09:37:29,158 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 169 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:37:29,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 147 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 09:37:29,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-14 09:37:29,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 149. [2024-10-14 09:37:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 104 states have (on average 1.2019230769230769) internal successors, (125), 104 states have internal predecessors, (125), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 09:37:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 197 transitions. [2024-10-14 09:37:29,199 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 197 transitions. Word has length 125 [2024-10-14 09:37:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:37:29,200 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 197 transitions. [2024-10-14 09:37:29,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:37:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 197 transitions. [2024-10-14 09:37:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 09:37:29,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:37:29,202 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:37:29,219 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 (6)] Forceful destruction successful, exit code 0 [2024-10-14 09:37:29,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-14 09:37:29,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:37:29,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:37:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1506995318, now seen corresponding path program 1 times [2024-10-14 09:37:29,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:37:29,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271551576] [2024-10-14 09:37:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:37:29,408 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-14 09:37:29,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:37:29,412 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-14 09:37:29,413 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-14 09:37:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:37:29,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 09:37:29,788 INFO L278 TraceCheckSpWp]: Computing forward predicates...