./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:29:44,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:29:44,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:29:44,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:29:44,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:29:44,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:29:44,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:29:44,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:29:44,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:29:44,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:29:44,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:29:44,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:29:44,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:29:44,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:29:44,739 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:29:44,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:29:44,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:29:44,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:29:44,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:29:44,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:29:44,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:29:44,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:29:44,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:29:44,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:29:44,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:29:44,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:29:44,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:29:44,744 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:29:44,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:29:44,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:29:44,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:29:44,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:29:44,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:29:44,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:29:44,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:29:44,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:29:44,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:29:44,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:29:44,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:29:44,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:29:44,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:29:44,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:29:44,748 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-10 03:29:44,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:29:45,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:29:45,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:29:45,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:29:45,036 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:29:45,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-10 03:29:46,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:29:46,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:29:46,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-10 03:29:46,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea41ecf8/3176097f7a9c46cc8cea0ac839a0c9b3/FLAG49f789715 [2024-11-10 03:29:46,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea41ecf8/3176097f7a9c46cc8cea0ac839a0c9b3 [2024-11-10 03:29:46,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:29:46,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:29:46,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:29:46,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:29:46,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:29:46,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:29:46" (1/1) ... [2024-11-10 03:29:46,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f55618b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:46, skipping insertion in model container [2024-11-10 03:29:46,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:29:46" (1/1) ... [2024-11-10 03:29:46,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:29:47,138 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-10 03:29:47,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:29:47,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:29:47,234 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-10 03:29:47,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:29:47,302 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:29:47,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47 WrapperNode [2024-11-10 03:29:47,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:29:47,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:29:47,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:29:47,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:29:47,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,362 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-10 03:29:47,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:29:47,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:29:47,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:29:47,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:29:47,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:29:47,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:29:47,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:29:47,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:29:47,426 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:29:47,427 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (1/1) ... [2024-11-10 03:29:47,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:29:47,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:29:47,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:29:47,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:29:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:29:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:29:47,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:29:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:29:47,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:29:47,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:29:47,601 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:29:47,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:29:47,977 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~short18#1; [2024-11-10 03:29:48,011 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 03:29:48,011 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:29:48,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:29:48,029 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:29:48,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:29:48 BoogieIcfgContainer [2024-11-10 03:29:48,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:29:48,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:29:48,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:29:48,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:29:48,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:29:46" (1/3) ... [2024-11-10 03:29:48,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eedf2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:29:48, skipping insertion in model container [2024-11-10 03:29:48,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:47" (2/3) ... [2024-11-10 03:29:48,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eedf2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:29:48, skipping insertion in model container [2024-11-10 03:29:48,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:29:48" (3/3) ... [2024-11-10 03:29:48,040 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-20.i [2024-11-10 03:29:48,063 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:29:48,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:29:48,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:29:48,127 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;@11dd3584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:29:48,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:29:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 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-10 03:29:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 03:29:48,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:29:48,141 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, 1, 1] [2024-11-10 03:29:48,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:29:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:29:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1449632708, now seen corresponding path program 1 times [2024-11-10 03:29:48,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:29:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158036296] [2024-11-10 03:29:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:29:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:29:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:29:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:29:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:29:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:29:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:29:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:29:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:29:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:29:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:29:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:29:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:29:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:29:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:29:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:29:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:29:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:29:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:29:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:29:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:29:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,507 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-10 03:29:48,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:29:48,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158036296] [2024-11-10 03:29:48,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158036296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:29:48,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:29:48,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:29:48,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043671564] [2024-11-10 03:29:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:29:48,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:29:48,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:29:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:29:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:29:48,535 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 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), 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-10 03:29:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:29:48,569 INFO L93 Difference]: Finished difference Result 136 states and 222 transitions. [2024-11-10 03:29:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:29:48,571 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), 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 128 [2024-11-10 03:29:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:29:48,578 INFO L225 Difference]: With dead ends: 136 [2024-11-10 03:29:48,579 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 03:29:48,584 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-10 03:29:48,587 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:29:48,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:29:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 03:29:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 03:29:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-10 03:29:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2024-11-10 03:29:48,670 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 128 [2024-11-10 03:29:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:29:48,671 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2024-11-10 03:29:48,672 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), 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-10 03:29:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2024-11-10 03:29:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 03:29:48,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:29:48,677 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, 1, 1] [2024-11-10 03:29:48,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:29:48,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:29:48,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:29:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 247831841, now seen corresponding path program 1 times [2024-11-10 03:29:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:29:48,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465388263] [2024-11-10 03:29:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:29:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:29:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:29:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:29:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:29:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:29:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:29:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:29:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:29:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:29:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:29:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:29:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:29:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:29:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:29:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:29:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:29:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:29:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:29:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:29:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:29:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:29:48,970 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-10 03:29:48,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:29:48,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465388263] [2024-11-10 03:29:48,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465388263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:29:48,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:29:48,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:29:48,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662660386] [2024-11-10 03:29:48,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:29:48,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:29:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:29:48,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:29:48,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:29:48,976 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10 03:29:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:29:49,041 INFO L93 Difference]: Finished difference Result 159 states and 229 transitions. [2024-11-10 03:29:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:29:49,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 128 [2024-11-10 03:29:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:29:49,043 INFO L225 Difference]: With dead ends: 159 [2024-11-10 03:29:49,043 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 03:29:49,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:29:49,045 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 34 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:29:49,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 190 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:29:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 03:29:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2024-11-10 03:29:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 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-10 03:29:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 107 transitions. [2024-11-10 03:29:49,062 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 107 transitions. Word has length 128 [2024-11-10 03:29:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:29:49,063 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 107 transitions. [2024-11-10 03:29:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10 03:29:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 107 transitions. [2024-11-10 03:29:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-10 03:29:49,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:29:49,067 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, 1, 1] [2024-11-10 03:29:49,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:29:49,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:29:49,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:29:49,068 INFO L85 PathProgramCache]: Analyzing trace with hash 758366018, now seen corresponding path program 1 times [2024-11-10 03:29:49,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:29:49,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437735253] [2024-11-10 03:29:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:29:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:29:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:29:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429161590] [2024-11-10 03:29:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:29:49,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:29:49,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:29:49,270 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-10 03:29:49,271 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-10 03:29:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:29:49,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:29:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:29:49,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:29:49,480 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:29:49,481 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:29:49,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:29:49,683 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-10 03:29:49,687 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 03:29:49,827 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:29:49,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:29:49 BoogieIcfgContainer [2024-11-10 03:29:49,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:29:49,836 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:29:49,836 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:29:49,836 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:29:49,836 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:29:48" (3/4) ... [2024-11-10 03:29:49,839 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:29:49,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:29:49,845 INFO L158 Benchmark]: Toolchain (without parser) took 2940.98ms. Allocated memory is still 182.5MB. Free memory was 110.7MB in the beginning and 109.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-10 03:29:49,845 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:29:49,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.14ms. Allocated memory is still 182.5MB. Free memory was 110.3MB in the beginning and 95.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 03:29:49,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.01ms. Allocated memory is still 182.5MB. Free memory was 95.2MB in the beginning and 91.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:29:49,850 INFO L158 Benchmark]: Boogie Preprocessor took 60.95ms. Allocated memory is still 182.5MB. Free memory was 91.4MB in the beginning and 86.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:29:49,851 INFO L158 Benchmark]: IcfgBuilder took 603.39ms. Allocated memory is still 182.5MB. Free memory was 86.2MB in the beginning and 142.1MB in the end (delta: -55.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-10 03:29:49,851 INFO L158 Benchmark]: TraceAbstraction took 1804.17ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 109.0MB in the end (delta: 33.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-10 03:29:49,851 INFO L158 Benchmark]: Witness Printer took 8.27ms. Allocated memory is still 182.5MB. Free memory is still 109.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:29:49,853 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 130.0MB. Free memory is still 91.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.14ms. Allocated memory is still 182.5MB. Free memory was 110.3MB in the beginning and 95.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.01ms. Allocated memory is still 182.5MB. Free memory was 95.2MB in the beginning and 91.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.95ms. Allocated memory is still 182.5MB. Free memory was 91.4MB in the beginning and 86.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 603.39ms. Allocated memory is still 182.5MB. Free memory was 86.2MB in the beginning and 142.1MB in the end (delta: -55.8MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1804.17ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 109.0MB in the end (delta: 33.1MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 8.27ms. Allocated memory is still 182.5MB. Free memory is still 109.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=639, 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=639, 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=639, 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=639, 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=639, 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=639, 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=639, 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=639, 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=639, 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=639, var_1_4=383, 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=639, var_1_4=383, 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=639, var_1_4=383, 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=639, var_1_4=383, 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=639, var_1_4=383, 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=639, var_1_4=383, 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=639, var_1_4=383, var_1_5=-146, 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=639, var_1_4=383, var_1_5=-146, 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=639, var_1_4=383, var_1_5=-146, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=-127, 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=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=32, var_1_7=0, 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=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, 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=17, 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=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, 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=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127, 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=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127] [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=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127] [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=127, var_1_18=63/2, var_1_1=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127] [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=127, var_1_18=2, var_1_1=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127] [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=127, var_1_18=2, var_1_1=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127] [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=127, var_1_18=2, var_1_1=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127] [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=127, var_1_18=2, var_1_1=0, var_1_2=1, var_1_3=639, var_1_4=383, var_1_5=-146, var_1_6=383, var_1_7=0, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 206 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 282 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-10 03:29:49,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:29:52,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:29:52,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:29:52,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:29:52,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:29:52,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:29:52,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:29:52,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:29:52,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:29:52,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:29:52,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:29:52,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:29:52,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:29:52,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:29:52,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:29:52,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:29:52,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:29:52,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:29:52,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:29:52,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:29:52,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:29:52,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:29:52,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:29:52,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:29:52,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:29:52,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:29:52,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:29:52,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:29:52,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:29:52,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:29:52,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:29:52,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:29:52,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:29:52,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:29:52,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:29:52,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:29:52,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:29:52,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:29:52,297 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:29:52,297 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:29:52,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:29:52,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:29:52,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:29:52,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:29:52,298 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-10 03:29:52,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:29:52,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:29:52,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:29:52,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:29:52,603 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:29:52,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-10 03:29:54,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:29:54,622 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:29:54,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-20.i [2024-11-10 03:29:54,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e4acb22/eb8b96dd2cc747caa7b0e922ba12fad2/FLAG7a145ce5f [2024-11-10 03:29:54,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e4acb22/eb8b96dd2cc747caa7b0e922ba12fad2 [2024-11-10 03:29:54,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:29:54,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:29:54,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:29:54,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:29:54,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:29:54,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:29:54" (1/1) ... [2024-11-10 03:29:54,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57407e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:54, skipping insertion in model container [2024-11-10 03:29:54,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:29:54" (1/1) ... [2024-11-10 03:29:54,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:29:54,918 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-10 03:29:55,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:29:55,022 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:29:55,033 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-10 03:29:55,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:29:55,094 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:29:55,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55 WrapperNode [2024-11-10 03:29:55,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:29:55,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:29:55,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:29:55,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:29:55,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,174 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-10 03:29:55,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:29:55,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:29:55,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:29:55,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:29:55,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,209 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:29:55,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:29:55,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:29:55,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:29:55,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:29:55,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (1/1) ... [2024-11-10 03:29:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:29:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:29:55,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:29:55,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:29:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:29:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:29:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:29:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:29:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:29:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:29:55,405 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:29:55,407 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:30:01,751 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 03:30:01,752 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:30:01,761 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:30:01,761 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:30:01,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:30:01 BoogieIcfgContainer [2024-11-10 03:30:01,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:30:01,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:30:01,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:30:01,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:30:01,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:29:54" (1/3) ... [2024-11-10 03:30:01,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3573b08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:30:01, skipping insertion in model container [2024-11-10 03:30:01,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:29:55" (2/3) ... [2024-11-10 03:30:01,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3573b08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:30:01, skipping insertion in model container [2024-11-10 03:30:01,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:30:01" (3/3) ... [2024-11-10 03:30:01,769 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-20.i [2024-11-10 03:30:01,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:30:01,802 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:30:01,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:30:01,862 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;@5766b11a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:30:01,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:30:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 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-10 03:30:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 03:30:01,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:30:01,878 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-10 03:30:01,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:30:01,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:30:01,883 INFO L85 PathProgramCache]: Analyzing trace with hash -231901166, now seen corresponding path program 1 times [2024-11-10 03:30:01,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:30:01,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678369551] [2024-11-10 03:30:01,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:30:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:30:01,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:30:01,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:30:01,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:30:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:30:02,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:30:02,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:30:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-10 03:30:02,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:30:02,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:30:02,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678369551] [2024-11-10 03:30:02,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678369551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:30:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:30:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:30:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84437693] [2024-11-10 03:30:02,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:30:02,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:30:02,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:30:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:30:02,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:30:02,578 INFO L87 Difference]: Start difference. First operand has 63 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 42 states have internal predecessors, (54), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-10 03:30:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:30:02,627 INFO L93 Difference]: Finished difference Result 118 states and 196 transitions. [2024-11-10 03:30:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:30:02,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (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 126 [2024-11-10 03:30:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:30:02,639 INFO L225 Difference]: With dead ends: 118 [2024-11-10 03:30:02,639 INFO L226 Difference]: Without dead ends: 58 [2024-11-10 03:30:02,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:30:02,646 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:30:02,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:30:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-10 03:30:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-10 03:30:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 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-10 03:30:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-10 03:30:02,701 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 126 [2024-11-10 03:30:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:30:02,702 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-10 03:30:02,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (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-10 03:30:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-10 03:30:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 03:30:02,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:30:02,705 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-10 03:30:02,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:30:02,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:30:02,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:30:02,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:30:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash 629417135, now seen corresponding path program 1 times [2024-11-10 03:30:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:30:02,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568953115] [2024-11-10 03:30:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:30:02,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:30:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:30:02,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:30:02,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:30:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:30:03,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 03:30:03,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:30:03,372 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-10 03:30:03,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:30:03,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:30:03,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568953115] [2024-11-10 03:30:03,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568953115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:30:03,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:30:03,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:30:03,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437071169] [2024-11-10 03:30:03,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:30:03,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:30:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:30:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:30:03,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:30:03,378 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-10 03:30:07,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:30:11,824 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-10 03:30:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:30:11,830 INFO L93 Difference]: Finished difference Result 132 states and 190 transitions. [2024-11-10 03:30:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:30:11,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-10 03:30:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:30:11,866 INFO L225 Difference]: With dead ends: 132 [2024-11-10 03:30:11,866 INFO L226 Difference]: Without dead ends: 77 [2024-11-10 03:30:11,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:30:11,868 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 21 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:30:11,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 160 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-10 03:30:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-10 03:30:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2024-11-10 03:30:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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-10 03:30:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2024-11-10 03:30:11,876 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 94 transitions. Word has length 126 [2024-11-10 03:30:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:30:11,878 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 94 transitions. [2024-11-10 03:30:11,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-10 03:30:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 94 transitions. [2024-11-10 03:30:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-10 03:30:11,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:30:11,880 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-10 03:30:11,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:30:12,084 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-10 03:30:12,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:30:12,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:30:12,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1134975760, now seen corresponding path program 1 times [2024-11-10 03:30:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:30:12,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842243193] [2024-11-10 03:30:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:30:12,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:30:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:30:12,090 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-10 03:30:12,092 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-10 03:30:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:30:12,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 03:30:12,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:30:55,414 WARN L286 SmtUtils]: Spent 9.94s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)