./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.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 a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:10:18,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:10:18,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:10:18,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:10:18,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:10:18,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:10:18,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:10:18,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:10:18,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:10:18,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:10:18,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:10:18,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:10:18,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:10:18,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:10:18,449 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:10:18,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:10:18,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:10:18,451 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:10:18,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:10:18,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:10:18,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:10:18,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:10:18,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:10:18,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:10:18,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:10:18,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:10:18,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:10:18,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:10:18,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:10:18,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:10:18,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:10:18,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:10:18,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:10:18,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:10:18,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:10:18,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:10:18,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:10:18,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:10:18,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:10:18,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:10:18,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:10:18,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:10:18,462 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 -> a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce [2024-10-24 11:10:18,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:10:18,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:10:18,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:10:18,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:10:18,738 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:10:18,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2024-10-24 11:10:20,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:10:20,370 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:10:20,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2024-10-24 11:10:20,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb17af2e1/da3893a1cd69425ab1e25776ff6d457d/FLAGf5ce4d7c8 [2024-10-24 11:10:20,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb17af2e1/da3893a1cd69425ab1e25776ff6d457d [2024-10-24 11:10:20,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:10:20,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:10:20,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:10:20,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:10:20,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:10:20,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a13471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20, skipping insertion in model container [2024-10-24 11:10:20,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:10:20,620 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i[913,926] [2024-10-24 11:10:20,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:10:20,679 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:10:20,688 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i[913,926] [2024-10-24 11:10:20,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:10:20,724 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:10:20,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20 WrapperNode [2024-10-24 11:10:20,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:10:20,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:10:20,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:10:20,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:10:20,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,771 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-10-24 11:10:20,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:10:20,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:10:20,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:10:20,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:10:20,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,815 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:10:20,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:10:20,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:10:20,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:10:20,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:10:20,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (1/1) ... [2024-10-24 11:10:20,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:10:20,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:10:20,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:10:20,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:10:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:10:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:10:20,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:10:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:10:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:10:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:10:20,984 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:10:20,985 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:10:21,300 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 11:10:21,300 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:10:21,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:10:21,345 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:10:21,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:10:21 BoogieIcfgContainer [2024-10-24 11:10:21,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:10:21,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:10:21,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:10:21,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:10:21,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:10:20" (1/3) ... [2024-10-24 11:10:21,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd856fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:10:21, skipping insertion in model container [2024-10-24 11:10:21,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:20" (2/3) ... [2024-10-24 11:10:21,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd856fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:10:21, skipping insertion in model container [2024-10-24 11:10:21,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:10:21" (3/3) ... [2024-10-24 11:10:21,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-82.i [2024-10-24 11:10:21,370 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:10:21,370 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:10:21,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:10:21,423 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;@1c3d9679, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:10:21,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:10:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:10:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:10:21,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:21,435 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:21,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:21,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -990705887, now seen corresponding path program 1 times [2024-10-24 11:10:21,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:10:21,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921404] [2024-10-24 11:10:21,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:21,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:10:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:10:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:10:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:10:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:10:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:10:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:10:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:10:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:10:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:10:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:10:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:10:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:10:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 11:10:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:10:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:10:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:10:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921404] [2024-10-24 11:10:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:10:21,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:10:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:10:21,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036615284] [2024-10-24 11:10:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:10:21,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:10:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:10:21,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:10:21,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:10:21,826 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:10:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:21,894 INFO L93 Difference]: Finished difference Result 101 states and 170 transitions. [2024-10-24 11:10:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:10:21,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-10-24 11:10:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:21,904 INFO L225 Difference]: With dead ends: 101 [2024-10-24 11:10:21,904 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 11:10:21,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:10:21,910 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:21,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:10:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 11:10:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-24 11:10:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:10:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-24 11:10:21,960 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 91 [2024-10-24 11:10:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:21,961 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-24 11:10:21,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:10:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-24 11:10:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:10:21,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:21,965 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:21,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:10:21,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:21,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2010895587, now seen corresponding path program 1 times [2024-10-24 11:10:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:10:21,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922287805] [2024-10-24 11:10:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:21,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:10:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:10:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:10:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:10:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:10:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:10:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:10:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:10:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:10:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:10:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:10:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:10:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:10:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 11:10:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:10:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:10:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:10:22,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922287805] [2024-10-24 11:10:22,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922287805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:10:22,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:10:22,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:10:22,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149995604] [2024-10-24 11:10:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:10:22,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:10:22,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:10:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:10:22,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:10:22,339 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:10:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:22,417 INFO L93 Difference]: Finished difference Result 115 states and 169 transitions. [2024-10-24 11:10:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:10:22,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-10-24 11:10:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:22,419 INFO L225 Difference]: With dead ends: 115 [2024-10-24 11:10:22,419 INFO L226 Difference]: Without dead ends: 66 [2024-10-24 11:10:22,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:10:22,421 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 17 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:22,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 194 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:10:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-24 11:10:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-10-24 11:10:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:10:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-10-24 11:10:22,441 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 91 [2024-10-24 11:10:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:22,443 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-10-24 11:10:22,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:10:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-10-24 11:10:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:10:22,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:22,448 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:10:22,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:22,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash -235212414, now seen corresponding path program 1 times [2024-10-24 11:10:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:10:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387198278] [2024-10-24 11:10:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:10:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:10:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:10:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:10:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:10:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:10:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 11:10:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 11:10:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:10:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:10:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 11:10:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 11:10:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 11:10:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 11:10:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 11:10:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:10:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:10:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387198278] [2024-10-24 11:10:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387198278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:10:22,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:10:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:10:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182393904] [2024-10-24 11:10:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:10:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:10:22,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:10:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:10:22,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:10:22,854 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:10:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:23,093 INFO L93 Difference]: Finished difference Result 172 states and 249 transitions. [2024-10-24 11:10:23,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:10:23,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-24 11:10:23,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:23,098 INFO L225 Difference]: With dead ends: 172 [2024-10-24 11:10:23,098 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 11:10:23,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:10:23,102 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 68 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:23,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 256 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:10:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 11:10:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2024-10-24 11:10:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 78 states have internal predecessors, (102), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:10:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-10-24 11:10:23,130 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 93 [2024-10-24 11:10:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:23,131 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-10-24 11:10:23,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:10:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-10-24 11:10:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:10:23,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:23,132 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:23,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:10:23,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:23,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:23,133 INFO L85 PathProgramCache]: Analyzing trace with hash 465852164, now seen corresponding path program 1 times [2024-10-24 11:10:23,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:10:23,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720519005] [2024-10-24 11:10:23,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:23,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:10:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:10:23,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:10:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:10:23,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:10:23,322 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:10:23,323 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:10:23,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:10:23,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 11:10:23,416 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:10:23,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:10:23 BoogieIcfgContainer [2024-10-24 11:10:23,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:10:23,422 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:10:23,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:10:23,422 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:10:23,422 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:10:21" (3/4) ... [2024-10-24 11:10:23,424 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:10:23,425 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:10:23,427 INFO L158 Benchmark]: Toolchain (without parser) took 3003.70ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 122.1MB in the beginning and 85.9MB in the end (delta: 36.2MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2024-10-24 11:10:23,428 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:10:23,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.35ms. Allocated memory is still 151.0MB. Free memory was 122.1MB in the beginning and 107.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 11:10:23,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.09ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:10:23,429 INFO L158 Benchmark]: Boogie Preprocessor took 63.26ms. Allocated memory is still 151.0MB. Free memory was 103.7MB in the beginning and 98.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:10:23,430 INFO L158 Benchmark]: RCFGBuilder took 509.38ms. Allocated memory is still 151.0MB. Free memory was 98.4MB in the beginning and 75.9MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 11:10:23,430 INFO L158 Benchmark]: TraceAbstraction took 2073.21ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 75.3MB in the beginning and 85.9MB in the end (delta: -10.5MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-10-24 11:10:23,430 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 188.7MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:10:23,432 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.16ms. Allocated memory is still 151.0MB. Free memory is still 108.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.35ms. Allocated memory is still 151.0MB. Free memory was 122.1MB in the beginning and 107.4MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.09ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.26ms. Allocated memory is still 151.0MB. Free memory was 103.7MB in the beginning and 98.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 509.38ms. Allocated memory is still 151.0MB. Free memory was 98.4MB in the beginning and 75.9MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2073.21ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 75.3MB in the beginning and 85.9MB in the end (delta: -10.5MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 188.7MB. Free memory is still 85.9MB. 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 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 128.75; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 63.5; [L25] float var_1_4 = 255.5; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_9 = 25; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 16; [L30] unsigned char var_1_12 = 2; [L31] unsigned char var_1_14 = 5; [L32] unsigned char var_1_15 = 10; [L33] double var_1_16 = 3.75; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 255.5; [L36] unsigned char last_1_var_1_5 = 32; [L37] unsigned char last_1_var_1_12 = 2; [L38] unsigned char last_1_var_1_17 = 0; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L94] last_1_var_1_5 = var_1_5 [L95] last_1_var_1_12 = var_1_12 [L96] last_1_var_1_17 = var_1_17 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L73] var_1_3 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L75] var_1_4 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L81] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L85] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L85] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L86] var_1_14 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L88] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L88] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L91] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=383, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=383, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L91] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=383, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L107] RET updateVariables() [L108] CALL step() [L42] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=383, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=128] [L42] signed long int stepLocal_0 = last_1_var_1_17 | last_1_var_1_12; [L43] COND FALSE !((last_1_var_1_5 / -2) >= stepLocal_0) [L46] var_1_5 = (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=383, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=0, var_1_9=128] [L48] COND FALSE !(! var_1_2) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=383, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=0, var_1_9=128] [L53] var_1_16 = var_1_4 [L54] var_1_17 = var_1_9 [L55] var_1_18 = var_1_3 [L56] unsigned char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, stepLocal_1=128, var_1_10=32895, var_1_11=-129, var_1_12=2, var_1_14=127, var_1_15=383, var_1_16=32901, var_1_17=128, var_1_18=32900, var_1_1=515/4, var_1_2=1, var_1_3=32900, var_1_4=32901, var_1_5=0, var_1_9=128] [L57] COND FALSE !((var_1_5 + var_1_11) >= stepLocal_1) [L66] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=128, var_1_14=127, var_1_15=383, var_1_16=32901, var_1_17=128, var_1_18=32900, var_1_1=515/4, var_1_2=1, var_1_3=32900, var_1_4=32901, var_1_5=0, var_1_9=128] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=128, var_1_14=127, var_1_15=383, var_1_16=32901, var_1_17=128, var_1_18=32900, var_1_1=515/4, var_1_2=1, var_1_3=32900, var_1_4=32901, var_1_5=0, var_1_9=128] [L99] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=128, var_1_14=127, var_1_15=383, var_1_16=32901, var_1_17=128, var_1_18=32900, var_1_1=515/4, var_1_2=1, var_1_3=32900, var_1_4=32901, var_1_5=0, var_1_9=128] [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=128, var_1_14=127, var_1_15=383, var_1_16=32901, var_1_17=128, var_1_18=32900, var_1_1=515/4, var_1_2=1, var_1_3=32900, var_1_4=32901, var_1_5=0, var_1_9=128] [L99-L100] return ((((((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) && (((var_1_5 + var_1_11) >= var_1_9) ? ((((((var_1_4) > ((var_1_1 * var_1_3))) ? (var_1_4) : ((var_1_1 * var_1_3)))) <= var_1_1) ? (var_1_12 == ((unsigned char) ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))))) : (var_1_2 ? (var_1_12 == ((unsigned char) (var_1_11 + var_1_15))) : 1)) : (var_1_12 == ((unsigned char) var_1_9)))) && (var_1_16 == ((double) var_1_4))) && (var_1_17 == ((unsigned char) var_1_9))) && (var_1_18 == ((double) var_1_3)) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=128, var_1_14=127, var_1_15=383, var_1_16=32901, var_1_17=128, var_1_18=32900, var_1_1=515/4, var_1_2=1, var_1_3=32900, var_1_4=32901, var_1_5=0, var_1_9=128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=32895, var_1_11=-129, var_1_12=128, var_1_14=127, var_1_15=383, var_1_16=32901, var_1_17=128, var_1_18=32900, var_1_1=515/4, var_1_2=1, var_1_3=32900, var_1_4=32901, var_1_5=0, var_1_9=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 316 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 205 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1092/1092 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:10:23,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.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 a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:10:25,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:10:25,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:10:25,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:10:25,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:10:25,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:10:25,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:10:25,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:10:25,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:10:25,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:10:25,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:10:25,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:10:25,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:10:25,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:10:25,837 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:10:25,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:10:25,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:10:25,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:10:25,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:10:25,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:10:25,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:10:25,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:10:25,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:10:25,840 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:10:25,840 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:10:25,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:10:25,841 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:10:25,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:10:25,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:10:25,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:10:25,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:10:25,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:10:25,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:10:25,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:10:25,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:10:25,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:10:25,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:10:25,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:10:25,844 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:10:25,845 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:10:25,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:10:25,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:10:25,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:10:25,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:10:25,846 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:10:25,846 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 -> a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce [2024-10-24 11:10:26,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:10:26,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:10:26,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:10:26,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:10:26,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:10:26,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2024-10-24 11:10:27,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:10:28,048 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:10:28,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2024-10-24 11:10:28,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc244b9b/07aa318ec4d64b4597c2e8947011f812/FLAGef9294e12 [2024-10-24 11:10:28,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc244b9b/07aa318ec4d64b4597c2e8947011f812 [2024-10-24 11:10:28,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:10:28,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:10:28,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:10:28,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:10:28,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:10:28,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c455614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28, skipping insertion in model container [2024-10-24 11:10:28,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:10:28,317 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i[913,926] [2024-10-24 11:10:28,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:10:28,388 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:10:28,402 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i[913,926] [2024-10-24 11:10:28,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:10:28,458 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:10:28,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28 WrapperNode [2024-10-24 11:10:28,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:10:28,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:10:28,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:10:28,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:10:28,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,514 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-10-24 11:10:28,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:10:28,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:10:28,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:10:28,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:10:28,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,556 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:10:28,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:10:28,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:10:28,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:10:28,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:10:28,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (1/1) ... [2024-10-24 11:10:28,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:10:28,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:10:28,631 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:10:28,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:10:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:10:28,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:10:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:10:28,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:10:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:10:28,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:10:28,779 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:10:28,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:10:30,197 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 11:10:30,198 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:10:30,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:10:30,259 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:10:30,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:10:30 BoogieIcfgContainer [2024-10-24 11:10:30,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:10:30,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:10:30,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:10:30,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:10:30,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:10:28" (1/3) ... [2024-10-24 11:10:30,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a12da96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:10:30, skipping insertion in model container [2024-10-24 11:10:30,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:10:28" (2/3) ... [2024-10-24 11:10:30,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a12da96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:10:30, skipping insertion in model container [2024-10-24 11:10:30,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:10:30" (3/3) ... [2024-10-24 11:10:30,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-82.i [2024-10-24 11:10:30,283 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:10:30,283 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:10:30,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:10:30,357 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;@6799d02f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:10:30,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:10:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:10:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:10:30,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:30,372 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:30,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:30,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:30,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1824637310, now seen corresponding path program 1 times [2024-10-24 11:10:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:10:30,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339994834] [2024-10-24 11:10:30,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:10:30,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:10:30,397 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:10:30,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:10:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:30,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:10:30,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:10:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-24 11:10:30,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:10:30,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:10:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339994834] [2024-10-24 11:10:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339994834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:10:30,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:10:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:10:30,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401837323] [2024-10-24 11:10:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:10:30,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:10:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:10:30,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:10:30,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:10:30,719 INFO L87 Difference]: Start difference. First operand has 42 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:10:31,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:10:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:31,882 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2024-10-24 11:10:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:10:31,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2024-10-24 11:10:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:31,904 INFO L225 Difference]: With dead ends: 81 [2024-10-24 11:10:31,904 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 11:10:31,907 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-10-24 11:10:31,910 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:31,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 11:10:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 11:10:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 11:10:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 11:10:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-24 11:10:31,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 87 [2024-10-24 11:10:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:31,946 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-24 11:10:31,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 11:10:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-24 11:10:31,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:10:31,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:31,953 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:31,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:10:32,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:10:32,154 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:32,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:32,155 INFO L85 PathProgramCache]: Analyzing trace with hash -717470854, now seen corresponding path program 1 times [2024-10-24 11:10:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:10:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469784184] [2024-10-24 11:10:32,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:32,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:10:32,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:10:32,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:10:32,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:10:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:32,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:10:32,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:10:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-24 11:10:32,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:10:32,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:10:32,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469784184] [2024-10-24 11:10:32,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469784184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:10:32,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:10:32,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:10:32,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983416897] [2024-10-24 11:10:32,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:10:32,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:10:32,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:10:32,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:10:32,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:10:32,801 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:10:34,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:10:35,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:10:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:10:35,341 INFO L93 Difference]: Finished difference Result 119 states and 176 transitions. [2024-10-24 11:10:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:10:35,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-10-24 11:10:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:10:35,356 INFO L225 Difference]: With dead ends: 119 [2024-10-24 11:10:35,356 INFO L226 Difference]: Without dead ends: 80 [2024-10-24 11:10:35,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:10:35,358 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 29 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:10:35,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 186 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 11:10:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-24 11:10:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2024-10-24 11:10:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:10:35,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-10-24 11:10:35,382 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 87 [2024-10-24 11:10:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:10:35,383 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-10-24 11:10:35,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-24 11:10:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-10-24 11:10:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 11:10:35,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:10:35,387 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:10:35,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:10:35,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:10:35,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:10:35,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:10:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1057536508, now seen corresponding path program 1 times [2024-10-24 11:10:35,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:10:35,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664258594] [2024-10-24 11:10:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:10:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:10:35,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:10:35,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:10:35,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:10:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:10:35,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 11:10:35,734 INFO L278 TraceCheckSpWp]: Computing forward predicates...