./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.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 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:39:07,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:39:07,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:39:07,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:39:07,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:39:07,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:39:07,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:39:07,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:39:07,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:39:07,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:39:07,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:39:07,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:39:07,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:39:07,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:39:07,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:39:07,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:39:07,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:39:07,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:39:07,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:39:07,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:39:07,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:39:07,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:39:07,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:39:07,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:39:07,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:39:07,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:39:07,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:39:07,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:39:07,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:39:07,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:39:07,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:39:07,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:39:07,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:07,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:39:07,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:39:07,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:39:07,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:39:07,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:39:07,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:39:07,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:39:07,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:39:07,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:39:07,691 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 -> 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 [2024-11-10 03:39:07,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:39:07,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:39:08,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:39:08,004 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:39:08,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:39:08,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-11-10 03:39:09,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:39:09,771 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:39:09,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-11-10 03:39:09,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f22dcad67/a4489b6271364127bc39ba52beeea094/FLAGef28463d7 [2024-11-10 03:39:09,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f22dcad67/a4489b6271364127bc39ba52beeea094 [2024-11-10 03:39:09,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:39:09,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:39:09,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:09,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:39:09,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:39:09,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:09" (1/1) ... [2024-11-10 03:39:09,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fdf8ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:09, skipping insertion in model container [2024-11-10 03:39:09,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:09" (1/1) ... [2024-11-10 03:39:09,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:39:10,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i[917,930] [2024-11-10 03:39:10,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:10,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:39:10,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i[917,930] [2024-11-10 03:39:10,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:10,211 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:39:10,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10 WrapperNode [2024-11-10 03:39:10,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:10,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:10,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:39:10,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:39:10,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,334 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-11-10 03:39:10,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:10,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:39:10,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:39:10,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:39:10,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,387 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:39:10,387 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:39:10,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:39:10,440 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:39:10,440 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:39:10,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (1/1) ... [2024-11-10 03:39:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:10,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:39:10,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:39:10,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:39:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:39:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:39:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:39:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:39:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:39:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:39:10,596 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:39:10,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:39:11,043 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc property_#t~ite23#1;havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2024-11-10 03:39:11,098 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 03:39:11,098 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:39:11,127 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:39:11,127 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:39:11,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:11 BoogieIcfgContainer [2024-11-10 03:39:11,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:39:11,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:39:11,132 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:39:11,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:39:11,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:39:09" (1/3) ... [2024-11-10 03:39:11,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee48d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:11, skipping insertion in model container [2024-11-10 03:39:11,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:10" (2/3) ... [2024-11-10 03:39:11,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee48d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:11, skipping insertion in model container [2024-11-10 03:39:11,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:11" (3/3) ... [2024-11-10 03:39:11,140 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-97.i [2024-11-10 03:39:11,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:39:11,159 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:39:11,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:39:11,244 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;@18331b44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:39:11,244 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:39:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:39:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-10 03:39:11,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:11,269 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:39:11,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1553499914, now seen corresponding path program 1 times [2024-11-10 03:39:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259110697] [2024-11-10 03:39:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:39:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:39:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:39:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:39:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:39:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:39:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:39:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:39:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:39:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:39:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:39:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:39:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:39:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:39:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:39:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:39:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:39:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:39:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:39:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:11,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 03:39:11,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:11,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259110697] [2024-11-10 03:39:11,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259110697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:11,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:11,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:39:11,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74738355] [2024-11-10 03:39:11,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:11,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:39:11,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:39:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:39:11,859 INFO L87 Difference]: Start difference. First operand has 102 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:39:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:11,904 INFO L93 Difference]: Finished difference Result 196 states and 331 transitions. [2024-11-10 03:39:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:39:11,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 179 [2024-11-10 03:39:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:11,922 INFO L225 Difference]: With dead ends: 196 [2024-11-10 03:39:11,922 INFO L226 Difference]: Without dead ends: 97 [2024-11-10 03:39:11,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:39:11,932 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:11,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:39:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-10 03:39:12,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-10 03:39:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:39:12,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-11-10 03:39:12,055 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 179 [2024-11-10 03:39:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:12,058 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-11-10 03:39:12,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:39:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-11-10 03:39:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 03:39:12,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:12,067 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:39:12,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:39:12,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1861981991, now seen corresponding path program 1 times [2024-11-10 03:39:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:12,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735492685] [2024-11-10 03:39:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:12,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:39:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:39:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:39:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:39:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:39:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:39:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:39:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:39:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:39:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:39:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:39:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:39:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:39:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:39:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:39:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:39:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:39:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:39:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:39:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 03:39:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735492685] [2024-11-10 03:39:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735492685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:13,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:13,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:39:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843195859] [2024-11-10 03:39:13,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:13,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:39:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:13,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:39:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:39:13,011 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 03:39:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:13,138 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2024-11-10 03:39:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:39:13,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-10 03:39:13,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:13,145 INFO L225 Difference]: With dead ends: 194 [2024-11-10 03:39:13,145 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 03:39:13,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:39:13,150 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 105 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:13,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 341 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:39:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 03:39:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-10 03:39:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:39:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-11-10 03:39:13,171 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 180 [2024-11-10 03:39:13,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:13,173 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-11-10 03:39:13,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 03:39:13,173 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-11-10 03:39:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 03:39:13,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:13,175 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:39:13,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:39:13,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:13,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash 790686715, now seen corresponding path program 1 times [2024-11-10 03:39:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:13,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701109798] [2024-11-10 03:39:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:13,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:39:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:39:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:39:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:39:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:39:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:39:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:39:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:39:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:39:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:39:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:39:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:39:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:39:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:39:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:39:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:39:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:39:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:39:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:39:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:39:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:39:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:39:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:39:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:39:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:39:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:39:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:39:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:39:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 03:39:17,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:39:17,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701109798] [2024-11-10 03:39:17,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701109798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:17,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:17,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:39:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381251118] [2024-11-10 03:39:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:17,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:39:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:39:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:39:17,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:39:17,047 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 03:39:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:18,397 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2024-11-10 03:39:18,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:39:18,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-11-10 03:39:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:18,402 INFO L225 Difference]: With dead ends: 267 [2024-11-10 03:39:18,402 INFO L226 Difference]: Without dead ends: 173 [2024-11-10 03:39:18,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:39:18,408 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 91 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:18,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 788 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:39:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-10 03:39:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 112. [2024-11-10 03:39:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:39:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2024-11-10 03:39:18,431 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 182 [2024-11-10 03:39:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:18,432 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 166 transitions. [2024-11-10 03:39:18,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 03:39:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 166 transitions. [2024-11-10 03:39:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 03:39:18,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:18,440 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:39:18,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:39:18,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:18,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 280152538, now seen corresponding path program 1 times [2024-11-10 03:39:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:39:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878940432] [2024-11-10 03:39:18,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:39:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:39:18,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:39:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:39:18,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:39:18,621 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:39:18,622 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:39:18,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:39:18,628 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:39:18,746 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:39:18,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:39:18 BoogieIcfgContainer [2024-11-10 03:39:18,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:39:18,750 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:39:18,750 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:39:18,750 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:39:18,751 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:11" (3/4) ... [2024-11-10 03:39:18,753 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:39:18,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:39:18,755 INFO L158 Benchmark]: Toolchain (without parser) took 8945.22ms. Allocated memory was 161.5MB in the beginning and 270.5MB in the end (delta: 109.1MB). Free memory was 91.4MB in the beginning and 84.6MB in the end (delta: 6.8MB). Peak memory consumption was 117.0MB. Max. memory is 16.1GB. [2024-11-10 03:39:18,755 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:39:18,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.24ms. Allocated memory is still 161.5MB. Free memory was 91.2MB in the beginning and 75.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:39:18,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.40ms. Allocated memory is still 161.5MB. Free memory was 74.9MB in the beginning and 129.9MB in the end (delta: -55.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-10 03:39:18,758 INFO L158 Benchmark]: Boogie Preprocessor took 102.71ms. Allocated memory is still 161.5MB. Free memory was 129.9MB in the beginning and 123.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:39:18,758 INFO L158 Benchmark]: IcfgBuilder took 689.55ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 92.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 03:39:18,759 INFO L158 Benchmark]: TraceAbstraction took 7617.76ms. Allocated memory was 161.5MB in the beginning and 270.5MB in the end (delta: 109.1MB). Free memory was 91.5MB in the beginning and 84.6MB in the end (delta: 6.9MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2024-11-10 03:39:18,759 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 270.5MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:39:18,760 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.25ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.24ms. Allocated memory is still 161.5MB. Free memory was 91.2MB in the beginning and 75.1MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.40ms. Allocated memory is still 161.5MB. Free memory was 74.9MB in the beginning and 129.9MB in the end (delta: -55.1MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.71ms. Allocated memory is still 161.5MB. Free memory was 129.9MB in the beginning and 123.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 689.55ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 92.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7617.76ms. Allocated memory was 161.5MB in the beginning and 270.5MB in the end (delta: 109.1MB). Free memory was 91.5MB in the beginning and 84.6MB in the end (delta: 6.9MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 270.5MB. Free memory is still 84.6MB. 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 144. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 32; [L25] unsigned char var_1_4 = 1; [L26] signed long int var_1_5 = 5; [L27] signed long int var_1_6 = 2; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] float var_1_9 = 128.6; [L31] float var_1_10 = 32.5; [L32] unsigned char var_1_11 = 16; [L33] unsigned char var_1_12 = 64; [L34] unsigned char var_1_13 = 4; [L35] unsigned char var_1_14 = 4; [L36] unsigned long int var_1_15 = 0; [L37] signed short int var_1_16 = 0; [L38] signed char var_1_17 = 1; [L39] signed char var_1_18 = -1; [L40] signed char var_1_19 = 0; [L41] signed long int var_1_20 = -64; [L42] signed long int var_1_21 = 25; [L43] unsigned char var_1_22 = 0; [L44] unsigned char var_1_23 = 0; VAL [isInitial=0, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_2=16, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] var_1_3 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L101] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] var_1_4 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L104] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L105] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L105] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L106] var_1_6 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L107] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L108] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L108] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L109] var_1_7 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_8=0, var_1_9=643/5] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_8=0, var_1_9=643/5] [L111] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L111] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0, var_1_9=643/5] [L112] var_1_9 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L113] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L114] var_1_10 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L115] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L116] var_1_11 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L117] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L118] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L118] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=68, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L119] var_1_12 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L120] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L121] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L121] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L122] var_1_13 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L123] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L124] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L125] var_1_14 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L126] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L127] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L127] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L128] var_1_18 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L129] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L130] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L130] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L131] var_1_19 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L132] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L133] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L133] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L134] var_1_21 = __VERIFIER_nondet_long() [L135] CALL assume_abort_if_not(var_1_21 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L135] RET assume_abort_if_not(var_1_21 >= -2147483647) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L136] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L152] RET updateVariables() [L153] CALL step() [L48] signed long int stepLocal_1 = var_1_2 + var_1_3; [L49] signed long int stepLocal_0 = - var_1_3; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L50] COND FALSE !(stepLocal_1 < -200) [L61] var_1_1 = var_1_2 VAL [isInitial=1, stepLocal_0=0, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L63] EXPR (32 * -25) | var_1_2 VAL [isInitial=1, stepLocal_0=0, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L63] signed long int stepLocal_4 = (32 * -25) | var_1_2; [L64] unsigned char stepLocal_3 = var_1_4; [L65] signed long int stepLocal_2 = var_1_3 - (var_1_2 + var_1_6); VAL [isInitial=1, stepLocal_0=0, stepLocal_2=-1073741823, stepLocal_3=0, stepLocal_4=-800, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L66] COND TRUE 256 > stepLocal_2 [L67] var_1_5 = var_1_2 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L77] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L80] COND TRUE \read(var_1_7) [L81] var_1_15 = var_1_6 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L83] var_1_16 = (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=1, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L84] COND FALSE !(\read(var_1_4)) [L91] var_1_17 = -32 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L93] var_1_20 = var_1_21 [L94] var_1_22 = var_1_23 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L144] EXPR (256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L144] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L144] EXPR (((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L144-L145] return (((((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=68, var_1_12=127, var_1_13=63, var_1_14=127, var_1_15=1073741823, var_1_16=-68, var_1_17=-32, var_1_18=0, var_1_19=16, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=1073741823, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 1270 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 865 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 405 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 64 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 723 NumberOfCodeBlocks, 723 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 538 ConstructedInterpolants, 0 QuantifiedInterpolants, 3628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4536/4536 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:39:18,823 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.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 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:39:21,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:39:21,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:39:21,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:39:21,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:39:21,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:39:21,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:39:21,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:39:21,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:39:21,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:39:21,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:39:21,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:39:21,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:39:21,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:39:21,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:39:21,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:39:21,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:39:21,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:39:21,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:39:21,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:39:21,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:39:21,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:39:21,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:39:21,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:39:21,426 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:39:21,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:39:21,426 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:39:21,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:39:21,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:39:21,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:39:21,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:39:21,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:39:21,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:39:21,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:39:21,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:21,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:39:21,431 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:39:21,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:39:21,432 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:39:21,432 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:39:21,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:39:21,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:39:21,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:39:21,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:39:21,434 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 -> 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 [2024-11-10 03:39:21,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:39:21,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:39:21,823 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:39:21,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:39:21,825 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:39:21,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-11-10 03:39:23,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:39:23,722 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:39:23,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-11-10 03:39:23,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab75f33e/75c92f3280de4dbf9639c1f1c9d2ee17/FLAG2f41d296e [2024-11-10 03:39:23,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab75f33e/75c92f3280de4dbf9639c1f1c9d2ee17 [2024-11-10 03:39:23,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:39:23,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:39:23,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:23,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:39:23,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:39:23,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:23" (1/1) ... [2024-11-10 03:39:23,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ebb549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:23, skipping insertion in model container [2024-11-10 03:39:23,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:39:23" (1/1) ... [2024-11-10 03:39:23,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:39:24,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i[917,930] [2024-11-10 03:39:24,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:24,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:39:24,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i[917,930] [2024-11-10 03:39:24,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:39:24,207 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:39:24,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24 WrapperNode [2024-11-10 03:39:24,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:39:24,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:24,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:39:24,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:39:24,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,274 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-10 03:39:24,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:39:24,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:39:24,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:39:24,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:39:24,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,306 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:39:24,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:39:24,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:39:24,324 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:39:24,324 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:39:24,325 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (1/1) ... [2024-11-10 03:39:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:39:24,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:39:24,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:39:24,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:39:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:39:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:39:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:39:24,411 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:39:24,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:39:24,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:39:24,521 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:39:24,524 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:39:24,916 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 03:39:24,916 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:39:24,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:39:24,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:39:24,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:24 BoogieIcfgContainer [2024-11-10 03:39:24,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:39:24,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:39:24,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:39:24,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:39:24,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:39:23" (1/3) ... [2024-11-10 03:39:24,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a04f634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:24, skipping insertion in model container [2024-11-10 03:39:24,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:39:24" (2/3) ... [2024-11-10 03:39:24,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a04f634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:39:24, skipping insertion in model container [2024-11-10 03:39:24,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:39:24" (3/3) ... [2024-11-10 03:39:24,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-97.i [2024-11-10 03:39:24,984 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:39:24,984 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:39:25,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:39:25,073 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;@4f829466, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:39:25,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:39:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:39:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:39:25,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:25,094 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:39:25,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:25,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:25,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1281869014, now seen corresponding path program 1 times [2024-11-10 03:39:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:39:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480978966] [2024-11-10 03:39:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:25,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:39:25,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:39:25,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:39:25,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:39:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:25,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:39:25,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:39:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-10 03:39:25,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:39:25,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:39:25,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480978966] [2024-11-10 03:39:25,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480978966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:39:25,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:39:25,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:39:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535798241] [2024-11-10 03:39:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:39:25,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:39:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:39:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:39:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:39:25,437 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:39:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:39:25,464 INFO L93 Difference]: Finished difference Result 148 states and 257 transitions. [2024-11-10 03:39:25,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:39:25,469 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 174 [2024-11-10 03:39:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:39:25,477 INFO L225 Difference]: With dead ends: 148 [2024-11-10 03:39:25,477 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 03:39:25,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:39:25,488 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:39:25,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:39:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 03:39:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-10 03:39:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 03:39:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2024-11-10 03:39:25,547 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 174 [2024-11-10 03:39:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:39:25,547 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2024-11-10 03:39:25,548 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 03:39:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2024-11-10 03:39:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-10 03:39:25,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:39:25,552 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:39:25,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:39:25,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:39:25,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:39:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:39:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1915913912, now seen corresponding path program 1 times [2024-11-10 03:39:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:39:25,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117647431] [2024-11-10 03:39:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:39:25,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:39:25,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:39:25,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:39:25,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:39:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:39:26,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 03:39:26,217 INFO L278 TraceCheckSpWp]: Computing forward predicates...