./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_codestructure_steplocals_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_codestructure_steplocals_file-20.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 80202e6356a531b702791c86039bd8c79ef8d6c3a99bbf935fc4214c36698253 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:36:32,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:36:32,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:36:32,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:36:32,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:36:32,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:36:32,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:36:32,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:36:32,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:36:32,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:36:32,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:36:32,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:36:32,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:36:32,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:36:32,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:36:32,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:36:32,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:36:32,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:36:32,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:36:32,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:36:32,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:36:32,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:36:32,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:36:32,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:36:32,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:36:32,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:36:32,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:36:32,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:36:32,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:36:32,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:36:32,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:36:32,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:36:32,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:36:32,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:36:32,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:36:32,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:36:32,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:36:32,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:36:32,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:36:32,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:36:32,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:36:32,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:36:32,889 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 -> 80202e6356a531b702791c86039bd8c79ef8d6c3a99bbf935fc4214c36698253 [2024-11-20 02:36:33,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:36:33,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:36:33,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:36:33,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:36:33,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:36:33,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-20 02:36:34,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:36:34,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:36:34,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-20 02:36:34,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c3321ad/dbb9fc82df494d3f88253cbd06a1f8ad/FLAG5758f7f70 [2024-11-20 02:36:35,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c3321ad/dbb9fc82df494d3f88253cbd06a1f8ad [2024-11-20 02:36:35,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:36:35,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:36:35,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:36:35,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:36:35,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:36:35,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b58718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35, skipping insertion in model container [2024-11-20 02:36:35,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:36:35,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i[917,930] [2024-11-20 02:36:35,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:36:35,629 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:36:35,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i[917,930] [2024-11-20 02:36:35,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:36:35,695 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:36:35,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35 WrapperNode [2024-11-20 02:36:35,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:36:35,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:36:35,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:36:35,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:36:35,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,766 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-11-20 02:36:35,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:36:35,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:36:35,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:36:35,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:36:35,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,801 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:36:35,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:36:35,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:36:35,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:36:35,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:36:35,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (1/1) ... [2024-11-20 02:36:35,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:36:35,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:36:35,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:36:35,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:36:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:36:35,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:36:35,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:36:35,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:36:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:36:35,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:36:36,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:36:36,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:36:36,379 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 02:36:36,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:36:36,394 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:36:36,394 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:36:36,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:36:36 BoogieIcfgContainer [2024-11-20 02:36:36,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:36:36,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:36:36,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:36:36,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:36:36,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:36:35" (1/3) ... [2024-11-20 02:36:36,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3f7c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:36:36, skipping insertion in model container [2024-11-20 02:36:36,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:35" (2/3) ... [2024-11-20 02:36:36,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3f7c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:36:36, skipping insertion in model container [2024-11-20 02:36:36,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:36:36" (3/3) ... [2024-11-20 02:36:36,402 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-20.i [2024-11-20 02:36:36,415 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:36:36,416 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:36:36,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:36:36,496 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;@31fada78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:36:36,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:36:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:36:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 02:36:36,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:36:36,516 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:36:36,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:36:36,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:36:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1123257622, now seen corresponding path program 1 times [2024-11-20 02:36:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:36:36,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504057294] [2024-11-20 02:36:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:36:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:36:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:36:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:36:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:36:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:36:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:36:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:36:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:36:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:36:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:36:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:36:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:36:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:36:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:36:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:36:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:36:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:36:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:36:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:36:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 02:36:36,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:36:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504057294] [2024-11-20 02:36:36,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504057294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:36:36,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:36:36,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:36:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604044477] [2024-11-20 02:36:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:36:36,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:36:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:36:37,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:36:37,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:36:37,019 INFO L87 Difference]: Start difference. First operand has 69 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:36:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:36:37,049 INFO L93 Difference]: Finished difference Result 131 states and 217 transitions. [2024-11-20 02:36:37,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:36:37,052 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 126 [2024-11-20 02:36:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:36:37,059 INFO L225 Difference]: With dead ends: 131 [2024-11-20 02:36:37,059 INFO L226 Difference]: Without dead ends: 65 [2024-11-20 02:36:37,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:36:37,066 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:36:37,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:36:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-20 02:36:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-20 02:36:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:36:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-11-20 02:36:37,106 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 126 [2024-11-20 02:36:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:36:37,107 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-11-20 02:36:37,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:36:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-11-20 02:36:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 02:36:37,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:36:37,111 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:36:37,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:36:37,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:36:37,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:36:37,113 INFO L85 PathProgramCache]: Analyzing trace with hash 738869488, now seen corresponding path program 1 times [2024-11-20 02:36:37,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:36:37,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317996087] [2024-11-20 02:36:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:37,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:36:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:37,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:36:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:36:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:36:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:36:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:36:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:36:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:36:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:36:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:36:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:36:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:36:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:36:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:36:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:36:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:36:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:36:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:36:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:36:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 02:36:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 02:36:38,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:36:38,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317996087] [2024-11-20 02:36:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317996087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:36:38,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:36:38,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:36:38,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864121596] [2024-11-20 02:36:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:36:38,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:36:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:36:38,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:36:38,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:36:38,083 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:36:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:36:38,391 INFO L93 Difference]: Finished difference Result 193 states and 276 transitions. [2024-11-20 02:36:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:36:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2024-11-20 02:36:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:36:38,394 INFO L225 Difference]: With dead ends: 193 [2024-11-20 02:36:38,394 INFO L226 Difference]: Without dead ends: 131 [2024-11-20 02:36:38,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:36:38,396 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 118 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:36:38,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 299 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:36:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-20 02:36:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 98. [2024-11-20 02:36:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.337837837837838) internal successors, (99), 75 states have internal predecessors, (99), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 02:36:38,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-11-20 02:36:38,423 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 126 [2024-11-20 02:36:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:36:38,424 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-11-20 02:36:38,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:36:38,424 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-11-20 02:36:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-20 02:36:38,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:36:38,428 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:36:38,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:36:38,429 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:36:38,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:36:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash 37804910, now seen corresponding path program 1 times [2024-11-20 02:36:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:36:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102831074] [2024-11-20 02:36:38,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:36:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:36:38,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1700595858] [2024-11-20 02:36:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:36:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:36:38,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:36:38,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:36:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:36:38,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:36:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:36:38,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:36:38,849 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:36:38,851 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:36:38,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:36:39,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:36:39,059 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 02:36:39,161 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:36:39,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:36:39 BoogieIcfgContainer [2024-11-20 02:36:39,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:36:39,166 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:36:39,166 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:36:39,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:36:39,167 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:36:36" (3/4) ... [2024-11-20 02:36:39,170 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:36:39,173 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:36:39,174 INFO L158 Benchmark]: Toolchain (without parser) took 3909.76ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 49.1MB in the end (delta: 58.0MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-20 02:36:39,174 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:36:39,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.61ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 134.6MB in the end (delta: -27.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 02:36:39,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.62ms. Allocated memory is still 165.7MB. Free memory was 134.6MB in the beginning and 130.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:36:39,177 INFO L158 Benchmark]: Boogie Preprocessor took 80.91ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 125.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:36:39,177 INFO L158 Benchmark]: RCFGBuilder took 546.15ms. Allocated memory is still 165.7MB. Free memory was 125.5MB in the beginning and 103.2MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 02:36:39,178 INFO L158 Benchmark]: TraceAbstraction took 2768.80ms. Allocated memory is still 165.7MB. Free memory was 102.5MB in the beginning and 50.2MB in the end (delta: 52.4MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. [2024-11-20 02:36:39,178 INFO L158 Benchmark]: Witness Printer took 6.82ms. Allocated memory is still 165.7MB. Free memory was 50.2MB in the beginning and 49.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:36:39,182 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 96.5MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.61ms. Allocated memory is still 165.7MB. Free memory was 107.1MB in the beginning and 134.6MB in the end (delta: -27.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.62ms. Allocated memory is still 165.7MB. Free memory was 134.6MB in the beginning and 130.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.91ms. Allocated memory is still 165.7MB. Free memory was 130.4MB in the beginning and 125.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 546.15ms. Allocated memory is still 165.7MB. Free memory was 125.5MB in the beginning and 103.2MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2768.80ms. Allocated memory is still 165.7MB. Free memory was 102.5MB in the beginning and 50.2MB in the end (delta: 52.4MB). Peak memory consumption was 55.5MB. Max. memory is 16.1GB. * Witness Printer took 6.82ms. Allocated memory is still 165.7MB. Free memory was 50.2MB in the beginning and 49.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryArithmeticFLOAToperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 2; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 32; [L28] signed long int var_1_7 = 128; [L29] unsigned short int var_1_8 = 100; [L30] float var_1_9 = 255.75; [L31] signed char var_1_10 = 64; [L32] signed char var_1_11 = 32; [L33] signed char var_1_12 = 4; [L34] float var_1_13 = 0.0; [L35] float var_1_14 = 7.25; [L36] float var_1_15 = 8.125; [L37] float var_1_16 = 24.5; [L38] signed short int var_1_17 = -256; [L39] double var_1_18 = 31.5; VAL [isInitial=0, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=0, var_1_3=128, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_3=128, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_3=128, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L85] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_3=128, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L86] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=128, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=128, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L86] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=128, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L87] var_1_3 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_3 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L88] RET assume_abort_if_not(var_1_3 >= 127) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L89] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L89] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=2, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L90] var_1_4 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L91] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L92] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L92] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=2, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L93] var_1_5 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L94] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L95] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L95] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=128, var_1_8=100, var_1_9=1023/4] [L96] var_1_7 = __VERIFIER_nondet_long() [L97] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L97] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L98] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L98] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L99] var_1_10 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L100] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L101] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L101] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L102] var_1_11 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L103] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L104] CALL assume_abort_if_not(var_1_11 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L104] RET assume_abort_if_not(var_1_11 <= 64) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L105] var_1_12 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L106] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L107] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L107] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L108] var_1_13 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L109] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L110] var_1_14 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L111] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L112] var_1_16 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L113] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=5, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L126] RET updateVariables() [L127] CALL step() [L43] COND TRUE \read(var_1_2) [L44] var_1_1 = (var_1_3 - var_1_4) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L48] signed long int stepLocal_0 = var_1_1 - (var_1_4 + var_1_7); VAL [isInitial=1, stepLocal_0=65, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=32, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L49] COND TRUE (64 + (var_1_5 / var_1_3)) != stepLocal_0 [L50] var_1_6 = var_1_4 VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L54] signed long int stepLocal_1 = var_1_3 - var_1_5; VAL [isInitial=1, stepLocal_1=18, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=100, var_1_9=1023/4] [L55] COND TRUE (var_1_6 + var_1_1) >= stepLocal_1 [L56] var_1_8 = ((((var_1_1) > (var_1_3)) ? (var_1_1) : (var_1_3))) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128, var_1_9=1023/4] [L60] COND TRUE ((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5 [L61] var_1_9 = (64.8f - (var_1_13 - var_1_14)) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128] [L65] var_1_15 = (var_1_14 + var_1_16) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=-256, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128] [L66] COND TRUE \read(var_1_2) [L67] var_1_17 = (var_1_3 + var_1_12) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_17=128, var_1_18=63/2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128] [L75] COND FALSE !((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_8)) [L80] var_1_18 = var_1_16 VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=128, var_1_18=2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128] [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (var_1_1 - (var_1_4 + var_1_7))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_6 + var_1_1) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_1) > (var_1_3)) ? (var_1_1) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_1)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_8)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=128, var_1_18=2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128] [L118-L119] return ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (var_1_1 - (var_1_4 + var_1_7))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_6 + var_1_1) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_1) > (var_1_3)) ? (var_1_1) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_1)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_8)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=128, var_1_18=2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128] [L19] reach_error() VAL [isInitial=1, var_1_10=127, var_1_11=0, var_1_12=0, var_1_16=2, var_1_17=128, var_1_18=2, var_1_1=128, var_1_2=1, var_1_3=-384, var_1_4=0, var_1_5=366, var_1_6=0, var_1_7=63, var_1_8=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 181 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:36:39,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.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 80202e6356a531b702791c86039bd8c79ef8d6c3a99bbf935fc4214c36698253 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:36:41,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:36:41,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:36:41,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:36:41,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:36:41,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:36:41,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:36:41,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:36:41,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:36:41,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:36:41,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:36:41,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:36:41,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:36:41,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:36:41,774 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:36:41,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:36:41,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:36:41,775 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:36:41,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:36:41,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:36:41,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:36:41,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:36:41,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:36:41,781 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:36:41,781 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:36:41,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:36:41,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:36:41,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:36:41,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:36:41,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:36:41,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:36:41,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:36:41,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:36:41,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:36:41,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:36:41,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:36:41,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:36:41,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:36:41,785 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:36:41,786 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:36:41,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:36:41,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:36:41,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:36:41,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:36:41,788 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 -> 80202e6356a531b702791c86039bd8c79ef8d6c3a99bbf935fc4214c36698253 [2024-11-20 02:36:42,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:36:42,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:36:42,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:36:42,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:36:42,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:36:42,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-20 02:36:43,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:36:44,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:36:44,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-20 02:36:44,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de4b868b/f57fc8511511440c91f9f3c6f7f9a647/FLAG9e6987562 [2024-11-20 02:36:44,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de4b868b/f57fc8511511440c91f9f3c6f7f9a647 [2024-11-20 02:36:44,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:36:44,334 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:36:44,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:36:44,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:36:44,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:36:44,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7d6406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44, skipping insertion in model container [2024-11-20 02:36:44,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:36:44,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i[917,930] [2024-11-20 02:36:44,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:36:44,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:36:44,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i[917,930] [2024-11-20 02:36:44,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:36:44,774 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:36:44,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44 WrapperNode [2024-11-20 02:36:44,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:36:44,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:36:44,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:36:44,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:36:44,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,843 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-20 02:36:44,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:36:44,848 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:36:44,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:36:44,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:36:44,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,889 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:36:44,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:36:44,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:36:44,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:36:44,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:36:44,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (1/1) ... [2024-11-20 02:36:44,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:36:44,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:36:44,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:36:44,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:36:45,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:36:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:36:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:36:45,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:36:45,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:36:45,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:36:45,110 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:36:45,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:36:51,491 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 02:36:51,491 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:36:51,511 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:36:51,511 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:36:51,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:36:51 BoogieIcfgContainer [2024-11-20 02:36:51,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:36:51,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:36:51,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:36:51,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:36:51,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:36:44" (1/3) ... [2024-11-20 02:36:51,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf54792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:36:51, skipping insertion in model container [2024-11-20 02:36:51,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:36:44" (2/3) ... [2024-11-20 02:36:51,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf54792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:36:51, skipping insertion in model container [2024-11-20 02:36:51,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:36:51" (3/3) ... [2024-11-20 02:36:51,523 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-20.i [2024-11-20 02:36:51,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:36:51,541 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:36:51,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:36:51,626 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;@7e003c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:36:51,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:36:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:36:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 02:36:51,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:36:51,649 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:36:51,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:36:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:36:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash 305956728, now seen corresponding path program 1 times [2024-11-20 02:36:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:36:51,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283133993] [2024-11-20 02:36:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:51,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:36:51,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:36:51,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:36:51,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:36:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:52,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:36:52,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:36:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-20 02:36:52,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:36:52,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:36:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283133993] [2024-11-20 02:36:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283133993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:36:52,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:36:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:36:52,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109962313] [2024-11-20 02:36:52,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:36:52,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:36:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:36:52,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:36:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:36:52,214 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:36:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:36:52,250 INFO L93 Difference]: Finished difference Result 113 states and 191 transitions. [2024-11-20 02:36:52,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:36:52,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 124 [2024-11-20 02:36:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:36:52,263 INFO L225 Difference]: With dead ends: 113 [2024-11-20 02:36:52,263 INFO L226 Difference]: Without dead ends: 56 [2024-11-20 02:36:52,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:36:52,272 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:36:52,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:36:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-20 02:36:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-20 02:36:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 02:36:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2024-11-20 02:36:52,319 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 124 [2024-11-20 02:36:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:36:52,320 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2024-11-20 02:36:52,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 02:36:52,320 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2024-11-20 02:36:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 02:36:52,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:36:52,323 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:36:52,338 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-11-20 02:36:52,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:36:52,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:36:52,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:36:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash -331211010, now seen corresponding path program 1 times [2024-11-20 02:36:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:36:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27257257] [2024-11-20 02:36:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:52,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:36:52,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:36:52,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:36:52,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:36:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:52,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 02:36:52,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:36:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 309 proven. 147 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-11-20 02:36:58,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:36:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 02:36:59,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:36:59,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27257257] [2024-11-20 02:36:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27257257] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 02:36:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 02:36:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-11-20 02:36:59,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056193219] [2024-11-20 02:36:59,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:36:59,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 02:36:59,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:36:59,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 02:36:59,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-20 02:36:59,857 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:37:08,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:12,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:16,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:20,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:24,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:28,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:32,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:36,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:40,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:43,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:47,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:37:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:37:47,823 INFO L93 Difference]: Finished difference Result 219 states and 296 transitions. [2024-11-20 02:37:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 02:37:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 124 [2024-11-20 02:37:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:37:47,840 INFO L225 Difference]: With dead ends: 219 [2024-11-20 02:37:47,843 INFO L226 Difference]: Without dead ends: 166 [2024-11-20 02:37:47,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2024-11-20 02:37:47,845 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 185 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:37:47,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 377 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 47.3s Time] [2024-11-20 02:37:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-20 02:37:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 83. [2024-11-20 02:37:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 60 states have internal predecessors, (78), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 02:37:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-20 02:37:47,880 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 124 [2024-11-20 02:37:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:37:47,881 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-20 02:37:47,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-20 02:37:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-20 02:37:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 02:37:47,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:37:47,890 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:37:47,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 02:37:48,091 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-11-20 02:37:48,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:37:48,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:37:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1011269380, now seen corresponding path program 1 times [2024-11-20 02:37:48,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:37:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596671609] [2024-11-20 02:37:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:37:48,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:37:48,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:37:48,096 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-11-20 02:37:48,097 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-11-20 02:37:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:37:48,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-20 02:37:48,625 INFO L278 TraceCheckSpWp]: Computing forward predicates...