./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.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 c1e5d1fd15ef08e2c60f66d4394512c6de56b3a22c0cefb479d0510f5537bce7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:02:40,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:02:40,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:02:40,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:02:40,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:02:40,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:02:40,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:02:40,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:02:40,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:02:40,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:02:40,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:02:40,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:02:40,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:02:40,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:02:40,845 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:02:40,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:02:40,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:02:40,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:02:40,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:02:40,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:02:40,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:02:40,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:02:40,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:02:40,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:02:40,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:02:40,850 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:02:40,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:02:40,850 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:02:40,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:02:40,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:02:40,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:02:40,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:02:40,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:02:40,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:02:40,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:02:40,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:02:40,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:02:40,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:02:40,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:02:40,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:02:40,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:02:40,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:02:40,860 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 -> c1e5d1fd15ef08e2c60f66d4394512c6de56b3a22c0cefb479d0510f5537bce7 [2024-10-13 00:02:41,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:02:41,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:02:41,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:02:41,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:02:41,177 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:02:41,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i [2024-10-13 00:02:42,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:02:42,933 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:02:42,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i [2024-10-13 00:02:42,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad1406ae/f891e59d8978434fa246b2d0113aede8/FLAG64e66ff78 [2024-10-13 00:02:43,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ad1406ae/f891e59d8978434fa246b2d0113aede8 [2024-10-13 00:02:43,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:02:43,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:02:43,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:02:43,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:02:43,313 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:02:43,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2330e1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43, skipping insertion in model container [2024-10-13 00:02:43,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:02:43,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i[913,926] [2024-10-13 00:02:43,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:02:43,633 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:02:43,645 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i[913,926] [2024-10-13 00:02:43,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:02:43,700 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:02:43,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43 WrapperNode [2024-10-13 00:02:43,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:02:43,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:02:43,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:02:43,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:02:43,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,788 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-10-13 00:02:43,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:02:43,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:02:43,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:02:43,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:02:43,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,841 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:02:43,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:02:43,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:02:43,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:02:43,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:02:43,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (1/1) ... [2024-10-13 00:02:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:02:43,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:02:43,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:02:43,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:02:43,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:02:43,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:02:43,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:02:43,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:02:43,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:02:43,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:02:44,116 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:02:44,118 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:02:44,561 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:02:44,561 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:02:44,590 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:02:44,591 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:02:44,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:44 BoogieIcfgContainer [2024-10-13 00:02:44,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:02:44,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:02:44,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:02:44,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:02:44,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:02:43" (1/3) ... [2024-10-13 00:02:44,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e11975e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:02:44, skipping insertion in model container [2024-10-13 00:02:44,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:43" (2/3) ... [2024-10-13 00:02:44,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e11975e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:02:44, skipping insertion in model container [2024-10-13 00:02:44,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:44" (3/3) ... [2024-10-13 00:02:44,600 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-47.i [2024-10-13 00:02:44,616 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:02:44,617 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:02:44,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:02:44,681 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;@986568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:02:44,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:02:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:02:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 00:02:44,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:02:44,698 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:02:44,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:02:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:02:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -938057098, now seen corresponding path program 1 times [2024-10-13 00:02:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:02:44,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948956014] [2024-10-13 00:02:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:02:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:02:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:02:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:02:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:02:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:02:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:02:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 00:02:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:02:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:02:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:02:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:02:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:02:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:02:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:02:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:02:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:02:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:02:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:02:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:02:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:02:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:02:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:02:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:02:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:02:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:02:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:02:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:02:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 00:02:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:02:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948956014] [2024-10-13 00:02:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948956014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:02:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:02:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:02:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406062892] [2024-10-13 00:02:45,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:02:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:02:45,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:02:45,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:02:45,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:02:45,288 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 60 states have internal predecessors, (90), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 00:02:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:02:45,333 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2024-10-13 00:02:45,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:02:45,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-10-13 00:02:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:02:45,347 INFO L225 Difference]: With dead ends: 173 [2024-10-13 00:02:45,347 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 00:02:45,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:02:45,356 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:02:45,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:02:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 00:02:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 00:02:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:02:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-10-13 00:02:45,409 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 161 [2024-10-13 00:02:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:02:45,412 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-10-13 00:02:45,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 00:02:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-10-13 00:02:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-13 00:02:45,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:02:45,416 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:02:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:02:45,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:02:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:02:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2054368845, now seen corresponding path program 1 times [2024-10-13 00:02:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:02:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38483607] [2024-10-13 00:02:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:02:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:02:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:02:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:02:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:02:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:02:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:02:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 00:02:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:02:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:02:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:02:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:02:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:02:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:02:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:02:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:02:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:02:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:02:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:02:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:02:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:02:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:02:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:02:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:02:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:02:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:02:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:02:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:02:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 00:02:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:02:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38483607] [2024-10-13 00:02:46,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38483607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:02:46,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247123040] [2024-10-13 00:02:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:02:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:02:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:02:46,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:02:46,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 00:02:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:46,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 00:02:46,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:02:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-10-13 00:02:47,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:02:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 117 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-10-13 00:02:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247123040] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:02:47,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 00:02:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-10-13 00:02:47,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119240818] [2024-10-13 00:02:47,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 00:02:47,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 00:02:47,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:02:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 00:02:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-13 00:02:47,903 INFO L87 Difference]: Start difference. First operand 86 states and 133 transitions. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (70), 3 states have call predecessors, (70), 7 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-13 00:02:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:02:49,133 INFO L93 Difference]: Finished difference Result 320 states and 462 transitions. [2024-10-13 00:02:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-13 00:02:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (70), 3 states have call predecessors, (70), 7 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 162 [2024-10-13 00:02:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:02:49,142 INFO L225 Difference]: With dead ends: 320 [2024-10-13 00:02:49,142 INFO L226 Difference]: Without dead ends: 235 [2024-10-13 00:02:49,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=624, Invalid=1632, Unknown=0, NotChecked=0, Total=2256 [2024-10-13 00:02:49,148 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 325 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 00:02:49,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 504 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 00:02:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-13 00:02:49,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 213. [2024-10-13 00:02:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 137 states have (on average 1.2627737226277371) internal successors, (173), 139 states have internal predecessors, (173), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:02:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 305 transitions. [2024-10-13 00:02:49,224 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 305 transitions. Word has length 162 [2024-10-13 00:02:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:02:49,225 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 305 transitions. [2024-10-13 00:02:49,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 6 states have call successors, (70), 3 states have call predecessors, (70), 7 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-10-13 00:02:49,226 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 305 transitions. [2024-10-13 00:02:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 00:02:49,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:02:49,231 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:02:49,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:02:49,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:02:49,432 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:02:49,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:02:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash 819567604, now seen corresponding path program 1 times [2024-10-13 00:02:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:02:49,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10336160] [2024-10-13 00:02:49,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:02:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:02:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:02:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841355910] [2024-10-13 00:02:49,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:02:49,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:02:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:02:49,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:02:49,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 00:02:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:02:49,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 00:02:49,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:02:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 295 proven. 66 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2024-10-13 00:02:50,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:02:50,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:02:50,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10336160] [2024-10-13 00:02:50,347 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 00:02:50,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841355910] [2024-10-13 00:02:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841355910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:02:50,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 00:02:50,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-13 00:02:50,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732871790] [2024-10-13 00:02:50,349 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 00:02:50,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:02:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:02:50,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:02:50,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:02:50,350 INFO L87 Difference]: Start difference. First operand 213 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:02:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:02:50,765 INFO L93 Difference]: Finished difference Result 401 states and 571 transitions. [2024-10-13 00:02:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:02:50,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-10-13 00:02:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:02:50,774 INFO L225 Difference]: With dead ends: 401 [2024-10-13 00:02:50,774 INFO L226 Difference]: Without dead ends: 229 [2024-10-13 00:02:50,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-10-13 00:02:50,778 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:02:50,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 371 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:02:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-13 00:02:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 217. [2024-10-13 00:02:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 143 states have internal predecessors, (179), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:02:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 311 transitions. [2024-10-13 00:02:50,815 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 311 transitions. Word has length 163 [2024-10-13 00:02:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:02:50,815 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 311 transitions. [2024-10-13 00:02:50,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:02:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 311 transitions. [2024-10-13 00:02:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-13 00:02:50,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:02:50,819 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:02:50,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:02:51,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-13 00:02:51,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:02:51,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:02:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash 876825906, now seen corresponding path program 1 times [2024-10-13 00:02:51,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:02:51,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512255976] [2024-10-13 00:02:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:02:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:02:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 00:02:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [870822574] [2024-10-13 00:02:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:02:51,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:02:51,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:02:51,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 00:02:51,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 00:02:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:02:51,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:02:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:02:51,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:02:51,424 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:02:51,425 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:02:51,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 00:02:51,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 00:02:51,630 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:02:51,723 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:02:51,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:02:51 BoogieIcfgContainer [2024-10-13 00:02:51,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:02:51,727 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:02:51,727 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:02:51,727 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:02:51,728 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:02:44" (3/4) ... [2024-10-13 00:02:51,731 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:02:51,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:02:51,733 INFO L158 Benchmark]: Toolchain (without parser) took 8426.67ms. Allocated memory was 140.5MB in the beginning and 226.5MB in the end (delta: 86.0MB). Free memory was 91.9MB in the beginning and 108.9MB in the end (delta: -17.0MB). Peak memory consumption was 71.2MB. Max. memory is 16.1GB. [2024-10-13 00:02:51,733 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 140.5MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:02:51,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.49ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 74.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 00:02:51,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.81ms. Allocated memory is still 140.5MB. Free memory was 74.7MB in the beginning and 69.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:02:51,734 INFO L158 Benchmark]: Boogie Preprocessor took 96.28ms. Allocated memory is still 140.5MB. Free memory was 69.7MB in the beginning and 63.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 00:02:51,734 INFO L158 Benchmark]: RCFGBuilder took 704.56ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 63.4MB in the beginning and 133.7MB in the end (delta: -70.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-13 00:02:51,737 INFO L158 Benchmark]: TraceAbstraction took 7132.64ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 133.7MB in the beginning and 110.0MB in the end (delta: 23.7MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-10-13 00:02:51,738 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 226.5MB. Free memory was 110.0MB in the beginning and 108.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:02:51,739 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.13ms. Allocated memory is still 140.5MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.49ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 74.7MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.81ms. Allocated memory is still 140.5MB. Free memory was 74.7MB in the beginning and 69.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.28ms. Allocated memory is still 140.5MB. Free memory was 69.7MB in the beginning and 63.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 704.56ms. Allocated memory was 140.5MB in the beginning and 188.7MB in the end (delta: 48.2MB). Free memory was 63.4MB in the beginning and 133.7MB in the end (delta: -70.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7132.64ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 133.7MB in the beginning and 110.0MB in the end (delta: 23.7MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 226.5MB. Free memory was 110.0MB in the beginning and 108.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 133. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_2 = 50.5; [L24] double var_1_3 = 0.875; [L25] unsigned short int var_1_4 = 49926; [L26] unsigned short int var_1_5 = 500; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 2; [L29] unsigned char var_1_8 = 64; [L30] unsigned short int var_1_9 = 5; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 10; [L33] float var_1_12 = 0.19999999999999996; [L34] float var_1_13 = 9.2; [L35] float var_1_14 = 5.8; [L36] float var_1_15 = 31.25; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 0; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; [L41] unsigned short int var_1_20 = 256; [L42] unsigned short int var_1_21 = 23544; [L43] unsigned long int var_1_22 = 64; [L137] isInitial = 1 [L138] FCALL initially() [L139] COND TRUE 1 [L140] FCALL updateLastVariables() [L141] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L89] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L90] var_1_3 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L91] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L92] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L92] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L93] var_1_4 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L95] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=500, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L96] var_1_5 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L98] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=10, var_1_7=2, var_1_8=64, var_1_9=5] [L99] var_1_6 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_7=2, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_7=2, var_1_8=64, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=2, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=2, var_1_8=64, var_1_9=5] [L101] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=2, var_1_8=64, var_1_9=5] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_8=64, var_1_9=5] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_8=64, var_1_9=5] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=5] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=5] [L105] var_1_9 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64] [L106] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64] [L107] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L107] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L108] var_1_10 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L110] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L114] var_1_13 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && 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=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L116] var_1_14 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L118] var_1_15 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L119] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L120] var_1_17 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L122] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L123] var_1_18 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L125] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L126] var_1_21 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L127] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L128] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L141] RET updateVariables() [L142] CALL step() [L47] COND TRUE var_1_2 >= (1.3 / var_1_3) [L48] var_1_1 = ((var_1_4 - var_1_5) - var_1_6) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L52] COND FALSE !(var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L57] COND FALSE !(\read(var_1_10)) [L62] var_1_12 = var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L64] COND FALSE !((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) [L67] var_1_16 = var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L69] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L74] COND TRUE var_1_6 <= var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=256, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L75] COND FALSE !(\read(var_1_16)) [L78] var_1_20 = 16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L83] EXPR 2 ^ var_1_1 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L83] EXPR (((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L83] COND FALSE !(var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) [L142] RET step() [L143] CALL, EXPR property() [L133] EXPR (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L133-L134] return (((((((var_1_2 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_5) - var_1_6))) : (var_1_1 == ((unsigned short int) ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (var_1_10 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_10 ? (((var_1_8 * var_1_7) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((var_1_6 + var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) + var_1_1)) ? (var_1_16 == ((unsigned char) (var_1_10 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_10) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_6 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_5))))) && ((var_1_8 >= (((((var_1_4 * var_1_6)) > ((2 ^ var_1_1))) ? ((var_1_4 * var_1_6)) : ((2 ^ var_1_1))))) ? (var_1_22 == ((unsigned long int) var_1_8)) : 1) ; [L143] RET, EXPR property() [L143] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_14=2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=0, var_1_20=16, var_1_21=16383, var_1_22=64, var_1_4=-16386, var_1_5=16383, var_1_6=-163841, var_1_7=49150, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 392 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 385 mSDsluCounter, 1005 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 624 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 840 IncrementalHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 381 mSDtfsCounter, 840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1137 NumberOfCodeBlocks, 1137 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 805 ConstructedInterpolants, 1 QuantifiedInterpolants, 2902 SizeOfPredicates, 6 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 6188/6500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:02:51,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.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 c1e5d1fd15ef08e2c60f66d4394512c6de56b3a22c0cefb479d0510f5537bce7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:02:54,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:02:54,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:02:54,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:02:54,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:02:54,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:02:54,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:02:54,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:02:54,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:02:54,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:02:54,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:02:54,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:02:54,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:02:54,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:02:54,235 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:02:54,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:02:54,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:02:54,240 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:02:54,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:02:54,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:02:54,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:02:54,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:02:54,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:02:54,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:02:54,244 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:02:54,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:02:54,244 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:02:54,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:02:54,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:02:54,245 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:02:54,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:02:54,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:02:54,246 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:02:54,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:02:54,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:02:54,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:02:54,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:02:54,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:02:54,248 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:02:54,248 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:02:54,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:02:54,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:02:54,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:02:54,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:02:54,250 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:02:54,250 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 -> c1e5d1fd15ef08e2c60f66d4394512c6de56b3a22c0cefb479d0510f5537bce7 [2024-10-13 00:02:54,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:02:54,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:02:54,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:02:54,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:02:54,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:02:54,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i [2024-10-13 00:02:56,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:02:56,575 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:02:56,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i [2024-10-13 00:02:56,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e6651825/6d9955df39e44e5a8e865f52b624cd85/FLAG143fbb40e [2024-10-13 00:02:56,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e6651825/6d9955df39e44e5a8e865f52b624cd85 [2024-10-13 00:02:56,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:02:56,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:02:56,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:02:56,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:02:56,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:02:56,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:02:56" (1/1) ... [2024-10-13 00:02:56,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385bb5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:56, skipping insertion in model container [2024-10-13 00:02:56,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:02:56" (1/1) ... [2024-10-13 00:02:56,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:02:57,136 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i[913,926] [2024-10-13 00:02:57,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:02:57,240 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:02:57,253 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-47.i[913,926] [2024-10-13 00:02:57,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:02:57,320 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:02:57,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57 WrapperNode [2024-10-13 00:02:57,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:02:57,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:02:57,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:02:57,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:02:57,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,391 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-10-13 00:02:57,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:02:57,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:02:57,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:02:57,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:02:57,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:02:57,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:02:57,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:02:57,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:02:57,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:02:57,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (1/1) ... [2024-10-13 00:02:57,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:02:57,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:02:57,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:02:57,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:02:57,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:02:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:02:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:02:57,558 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:02:57,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:02:57,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:02:57,637 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:02:57,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:03:10,422 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 00:03:10,423 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:03:10,489 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:03:10,491 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:03:10,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:03:10 BoogieIcfgContainer [2024-10-13 00:03:10,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:03:10,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:03:10,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:03:10,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:03:10,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:02:56" (1/3) ... [2024-10-13 00:03:10,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37aab2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:03:10, skipping insertion in model container [2024-10-13 00:03:10,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:02:57" (2/3) ... [2024-10-13 00:03:10,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37aab2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:03:10, skipping insertion in model container [2024-10-13 00:03:10,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:03:10" (3/3) ... [2024-10-13 00:03:10,502 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-47.i [2024-10-13 00:03:10,522 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:03:10,522 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:03:10,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:03:10,608 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;@1406cb0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:03:10,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:03:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:03:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 00:03:10,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:10,630 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:03:10,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:10,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1769103112, now seen corresponding path program 1 times [2024-10-13 00:03:10,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:03:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665385512] [2024-10-13 00:03:10,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:10,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:03:10,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:03:10,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:03:10,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:03:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:11,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:03:11,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:03:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 666 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-13 00:03:11,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:03:11,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:03:11,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665385512] [2024-10-13 00:03:11,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665385512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:03:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:03:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:03:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812663203] [2024-10-13 00:03:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:03:11,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:03:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:03:11,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:03:11,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:03:11,668 INFO L87 Difference]: Start difference. First operand has 65 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:03:15,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:03:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:03:15,909 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2024-10-13 00:03:15,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:03:15,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 157 [2024-10-13 00:03:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:03:15,992 INFO L225 Difference]: With dead ends: 127 [2024-10-13 00:03:15,992 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 00:03:15,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:03:16,000 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:03:16,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 00:03:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 00:03:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 00:03:16,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:03:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2024-10-13 00:03:16,040 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 157 [2024-10-13 00:03:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:03:16,041 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2024-10-13 00:03:16,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:03:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2024-10-13 00:03:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 00:03:16,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:16,046 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:03:16,068 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-10-13 00:03:16,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:03:16,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:16,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:16,248 INFO L85 PathProgramCache]: Analyzing trace with hash 814830272, now seen corresponding path program 1 times [2024-10-13 00:03:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:03:16,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792681052] [2024-10-13 00:03:16,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:16,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:03:16,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:03:16,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:03:16,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:03:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:17,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 00:03:17,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:03:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 465 proven. 15 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-13 00:03:18,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:03:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 00:03:20,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:03:20,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792681052] [2024-10-13 00:03:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792681052] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:03:20,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:03:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-13 00:03:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135185131] [2024-10-13 00:03:20,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:03:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:03:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:03:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:03:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:03:20,490 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 00:03:26,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:03:30,931 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-10-13 00:03:34,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:03:38,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:03:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:03:45,759 INFO L93 Difference]: Finished difference Result 300 states and 459 transitions. [2024-10-13 00:03:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-13 00:03:45,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 157 [2024-10-13 00:03:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:03:45,768 INFO L225 Difference]: With dead ends: 300 [2024-10-13 00:03:45,769 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 00:03:45,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-10-13 00:03:45,775 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 266 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 178 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:03:45,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 422 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 509 Invalid, 4 Unknown, 0 Unchecked, 23.4s Time] [2024-10-13 00:03:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 00:03:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 158. [2024-10-13 00:03:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 83 states have internal predecessors, (98), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-13 00:03:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2024-10-13 00:03:45,845 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 157 [2024-10-13 00:03:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:03:45,850 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2024-10-13 00:03:45,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-13 00:03:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2024-10-13 00:03:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 00:03:45,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:03:45,857 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:03:45,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:03:46,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:03:46,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:03:46,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:03:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1705129662, now seen corresponding path program 1 times [2024-10-13 00:03:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:03:46,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495742689] [2024-10-13 00:03:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:03:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:03:46,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:03:46,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 00:03:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:46,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 00:03:46,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:03:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-10-13 00:03:53,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:03:55,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:03:55,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495742689] [2024-10-13 00:03:55,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495742689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:03:55,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778533435] [2024-10-13 00:03:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:03:55,405 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 00:03:55,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 00:03:55,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 00:03:55,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 00:03:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:03:57,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 00:03:57,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:04:03,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 599 proven. 114 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-10-13 00:04:03,234 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:04:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [778533435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 00:04:05,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:04:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 00:04:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629350538] [2024-10-13 00:04:05,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:04:05,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 00:04:05,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:04:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 00:04:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:04:05,027 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26)