./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_floatingpointinfluence_no-floats_file-81.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_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:40:51,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:40:51,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:40:51,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:40:51,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:40:51,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:40:51,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:40:51,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:40:51,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:40:51,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:40:51,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:40:51,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:40:51,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:40:51,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:40:51,479 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:40:51,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:40:51,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:40:51,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:40:51,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:40:51,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:40:51,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:40:51,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:40:51,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:40:51,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:40:51,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:40:51,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:40:51,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:40:51,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:40:51,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:40:51,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:40:51,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:40:51,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:40:51,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:40:51,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:40:51,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:40:51,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:40:51,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:40:51,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:40:51,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:40:51,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:40:51,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:40:51,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:40:51,489 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2024-10-13 03:40:51,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:40:51,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:40:51,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:40:51,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:40:51,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:40:51,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-13 03:40:53,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:40:53,479 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:40:53,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-13 03:40:53,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a6abe09/1e4e531a428d4b9cb7112bd73c7a9cf6/FLAG54a986259 [2024-10-13 03:40:53,502 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a6abe09/1e4e531a428d4b9cb7112bd73c7a9cf6 [2024-10-13 03:40:53,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:40:53,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:40:53,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:40:53,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:40:53,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:40:53,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbff5a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53, skipping insertion in model container [2024-10-13 03:40:53,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:40:53,689 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-10-13 03:40:53,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:40:53,756 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:40:53,765 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-10-13 03:40:53,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:40:53,796 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:40:53,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53 WrapperNode [2024-10-13 03:40:53,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:40:53,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:40:53,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:40:53,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:40:53,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,841 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-10-13 03:40:53,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:40:53,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:40:53,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:40:53,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:40:53,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,868 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 03:40:53,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:40:53,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:40:53,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:40:53,890 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:40:53,891 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (1/1) ... [2024-10-13 03:40:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:40:53,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:40:53,947 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 03:40:53,960 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 03:40:53,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:40:53,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:40:53,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:40:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:40:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:40:53,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:40:54,063 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:40:54,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:40:54,317 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 03:40:54,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:40:54,356 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:40:54,357 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:40:54,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:40:54 BoogieIcfgContainer [2024-10-13 03:40:54,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:40:54,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:40:54,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:40:54,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:40:54,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:40:53" (1/3) ... [2024-10-13 03:40:54,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea7f5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:40:54, skipping insertion in model container [2024-10-13 03:40:54,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:40:53" (2/3) ... [2024-10-13 03:40:54,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea7f5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:40:54, skipping insertion in model container [2024-10-13 03:40:54,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:40:54" (3/3) ... [2024-10-13 03:40:54,366 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-13 03:40:54,379 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:40:54,379 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:40:54,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:40:54,431 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;@7de4b70b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:40:54,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:40:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:40:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 03:40:54,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:54,445 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:54,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:54,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 456306652, now seen corresponding path program 1 times [2024-10-13 03:40:54,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412940765] [2024-10-13 03:40:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:40:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:40:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:40:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:40:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:40:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412940765] [2024-10-13 03:40:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412940765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:40:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199046115] [2024-10-13 03:40:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:54,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:40:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:54,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:40:54,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:40:54,851 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:40:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:54,945 INFO L93 Difference]: Finished difference Result 127 states and 224 transitions. [2024-10-13 03:40:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:40:54,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 135 [2024-10-13 03:40:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:54,954 INFO L225 Difference]: With dead ends: 127 [2024-10-13 03:40:54,955 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 03:40:54,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 03:40:54,964 INFO L432 NwaCegarLoop]: 94 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, 94 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 03:40:54,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:54,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 03:40:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-13 03:40:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:40:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 97 transitions. [2024-10-13 03:40:55,002 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 97 transitions. Word has length 135 [2024-10-13 03:40:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:55,003 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 97 transitions. [2024-10-13 03:40:55,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:40:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 97 transitions. [2024-10-13 03:40:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 03:40:55,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:55,007 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:55,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:40:55,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash -841355620, now seen corresponding path program 1 times [2024-10-13 03:40:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586530618] [2024-10-13 03:40:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:40:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:40:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:40:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:40:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:40:55,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:55,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586530618] [2024-10-13 03:40:55,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586530618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:55,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:55,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:40:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684414962] [2024-10-13 03:40:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:40:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:55,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:40:55,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:40:55,330 INFO L87 Difference]: Start difference. First operand 63 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:55,523 INFO L93 Difference]: Finished difference Result 188 states and 290 transitions. [2024-10-13 03:40:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:40:55,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-13 03:40:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:55,526 INFO L225 Difference]: With dead ends: 188 [2024-10-13 03:40:55,526 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 03:40:55,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:40:55,528 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 65 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:55,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 250 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:40:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 03:40:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2024-10-13 03:40:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:40:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2024-10-13 03:40:55,569 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 135 [2024-10-13 03:40:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:55,570 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2024-10-13 03:40:55,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2024-10-13 03:40:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:40:55,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:55,574 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:55,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:40:55,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:55,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2041516913, now seen corresponding path program 1 times [2024-10-13 03:40:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:55,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703830474] [2024-10-13 03:40:55,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:40:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:40:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:40:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:40:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:40:55,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:55,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703830474] [2024-10-13 03:40:55,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703830474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:55,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:55,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:40:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338991824] [2024-10-13 03:40:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:55,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:40:55,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:55,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:40:55,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:40:55,900 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:55,994 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2024-10-13 03:40:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:40:55,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-13 03:40:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:55,997 INFO L225 Difference]: With dead ends: 198 [2024-10-13 03:40:56,000 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 03:40:56,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:40:56,002 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 15 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:56,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 262 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:40:56,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 03:40:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2024-10-13 03:40:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:40:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 186 transitions. [2024-10-13 03:40:56,021 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 186 transitions. Word has length 136 [2024-10-13 03:40:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:56,022 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 186 transitions. [2024-10-13 03:40:56,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 186 transitions. [2024-10-13 03:40:56,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 03:40:56,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:56,024 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:56,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:40:56,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:56,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1984258611, now seen corresponding path program 1 times [2024-10-13 03:40:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:56,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137139426] [2024-10-13 03:40:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:40:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:40:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:40:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:40:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:40:56,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:56,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137139426] [2024-10-13 03:40:56,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137139426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:56,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:56,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:40:56,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187903998] [2024-10-13 03:40:56,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:56,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:40:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:56,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:40:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:40:56,338 INFO L87 Difference]: Start difference. First operand 122 states and 186 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:56,417 INFO L93 Difference]: Finished difference Result 198 states and 304 transitions. [2024-10-13 03:40:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:40:56,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-13 03:40:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:56,422 INFO L225 Difference]: With dead ends: 198 [2024-10-13 03:40:56,424 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 03:40:56,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:40:56,426 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 23 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:56,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 252 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 03:40:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 118. [2024-10-13 03:40:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:40:56,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2024-10-13 03:40:56,447 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 136 [2024-10-13 03:40:56,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:56,448 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2024-10-13 03:40:56,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2024-10-13 03:40:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 03:40:56,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:56,450 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:56,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:40:56,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:56,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:56,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1106120698, now seen corresponding path program 1 times [2024-10-13 03:40:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:56,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555395539] [2024-10-13 03:40:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:56,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:40:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:40:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:40:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:40:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:40:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 03:40:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 03:40:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 03:40:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:40:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:40:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:56,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555395539] [2024-10-13 03:40:56,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555395539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:56,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:56,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:40:56,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127671725] [2024-10-13 03:40:56,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:56,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:40:56,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:56,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:40:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:40:56,631 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:56,768 INFO L93 Difference]: Finished difference Result 201 states and 303 transitions. [2024-10-13 03:40:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:40:56,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-10-13 03:40:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:56,771 INFO L225 Difference]: With dead ends: 201 [2024-10-13 03:40:56,771 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 03:40:56,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:40:56,772 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:56,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 255 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:40:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 03:40:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2024-10-13 03:40:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:40:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 178 transitions. [2024-10-13 03:40:56,808 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 178 transitions. Word has length 139 [2024-10-13 03:40:56,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:56,809 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 178 transitions. [2024-10-13 03:40:56,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:40:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 178 transitions. [2024-10-13 03:40:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 03:40:56,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:56,814 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:56,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:40:56,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:56,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 528028140, now seen corresponding path program 1 times [2024-10-13 03:40:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956257581] [2024-10-13 03:40:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:40:56,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:40:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:40:57,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:40:57,061 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:40:57,062 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:40:57,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:40:57,068 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 03:40:57,144 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:40:57,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:40:57 BoogieIcfgContainer [2024-10-13 03:40:57,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:40:57,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:40:57,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:40:57,147 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:40:57,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:40:54" (3/4) ... [2024-10-13 03:40:57,149 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:40:57,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:40:57,151 INFO L158 Benchmark]: Toolchain (without parser) took 3645.31ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 60.0MB in the beginning and 164.9MB in the end (delta: -104.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:40:57,151 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory was 99.6MB in the beginning and 99.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:40:57,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.89ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 59.9MB in the beginning and 150.5MB in the end (delta: -90.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-13 03:40:57,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.74ms. Allocated memory is still 188.7MB. Free memory was 150.5MB in the beginning and 148.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:40:57,151 INFO L158 Benchmark]: Boogie Preprocessor took 46.59ms. Allocated memory is still 188.7MB. Free memory was 148.1MB in the beginning and 144.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:40:57,152 INFO L158 Benchmark]: RCFGBuilder took 468.38ms. Allocated memory is still 188.7MB. Free memory was 144.2MB in the beginning and 121.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 03:40:57,152 INFO L158 Benchmark]: TraceAbstraction took 2786.59ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 119.9MB in the beginning and 166.0MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:40:57,152 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 226.5MB. Free memory was 166.0MB in the beginning and 164.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:40:57,153 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.17ms. Allocated memory is still 130.0MB. Free memory was 99.6MB in the beginning and 99.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.89ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 59.9MB in the beginning and 150.5MB in the end (delta: -90.6MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.74ms. Allocated memory is still 188.7MB. Free memory was 150.5MB in the beginning and 148.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.59ms. Allocated memory is still 188.7MB. Free memory was 148.1MB in the beginning and 144.2MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 468.38ms. Allocated memory is still 188.7MB. Free memory was 144.2MB in the beginning and 121.1MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2786.59ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 119.9MB in the beginning and 166.0MB in the end (delta: -46.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 226.5MB. Free memory was 166.0MB in the beginning and 164.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 bitwiseOr at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 9999; [L23] unsigned char var_1_2 = 1; [L24] signed long int var_1_3 = 4; [L25] signed long int var_1_4 = 2; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 999999999; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = 16; [L30] signed char var_1_12 = 16; [L31] unsigned short int var_1_13 = 5; [L32] unsigned char var_1_14 = 1; [L33] unsigned short int var_1_15 = 16; [L34] unsigned short int var_1_16 = 32647; [L35] unsigned short int var_1_17 = 128; [L36] signed long int var_1_18 = -8; [L37] unsigned short int last_1_var_1_13 = 5; [L38] signed long int last_1_var_1_18 = -8; [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] CALL updateLastVariables() [L106] last_1_var_1_13 = var_1_13 [L107] last_1_var_1_18 = var_1_18 [L117] RET updateLastVariables() [L118] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=4, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=2, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L78] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=0, var_1_6=999999999, var_1_7=-128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L81] RET assume_abort_if_not(var_1_5 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=999999999, var_1_7=-128] [L83] var_1_6 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=16, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L86] var_1_11 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=16, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L89] var_1_12 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=16, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L95] var_1_15 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=32647, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L98] var_1_16 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L99] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L100] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=128, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L102] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] CALL assume_abort_if_not(var_1_17 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L103] RET assume_abort_if_not(var_1_17 <= 32767) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L118] RET updateVariables() [L119] CALL step() [L42] signed long int stepLocal_0 = (((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18)); VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_0=-25, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-128] [L43] COND FALSE !(stepLocal_0 != (last_1_var_1_18 ^ last_1_var_1_13)) [L48] var_1_7 = ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L50] unsigned char stepLocal_1 = var_1_11 >= var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_1=1, var_1_11=1, var_1_12=-2, var_1_13=5, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L51] COND TRUE stepLocal_1 && var_1_14 [L52] var_1_13 = ((((var_1_15) < (100)) ? (var_1_15) : (100))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L56] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, stepLocal_2=-2, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=-8, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L57] COND FALSE !(stepLocal_2 > var_1_16) [L64] var_1_18 = var_1_15 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=9999, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L66] COND TRUE \read(var_1_2) [L67] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L110] EXPR last_1_var_1_18 ^ last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L110] EXPR (var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L110-L111] return (((var_1_2 ? (var_1_1 == ((signed long int) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (last_1_var_1_18)) ? (-25) : (last_1_var_1_18))) != (last_1_var_1_18 ^ last_1_var_1_13)) ? (var_1_2 ? (var_1_7 == ((signed char) (var_1_11 + var_1_12))) : 1) : (var_1_7 == ((signed char) ((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11))))))) && (((var_1_11 >= var_1_7) && var_1_14) ? (var_1_13 == ((unsigned short int) ((((var_1_15) < (100)) ? (var_1_15) : (100))))) : (var_1_13 == ((unsigned short int) ((var_1_16 - 5) + var_1_17))))) && ((var_1_7 > var_1_16) ? ((var_1_3 < (var_1_5 - var_1_6)) ? (var_1_18 == ((signed long int) ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) : (var_1_18 == ((signed long int) var_1_13))) : (var_1_18 == ((signed long int) var_1_15))) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=5, last_1_var_1_18=-8, var_1_11=1, var_1_12=-2, var_1_13=100, var_1_14=1, var_1_15=65534, var_1_16=-49153, var_1_17=0, var_1_18=65534, var_1_1=2147483647, var_1_2=1, var_1_3=2147483647, var_1_4=0, var_1_5=2147483647, var_1_6=0, var_1_7=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 1113 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 657 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 456 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 5 MinimizatonAttempts, 46 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 824 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4620/4620 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 03:40:57,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.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 fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:40:59,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:40:59,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:40:59,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:40:59,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:40:59,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:40:59,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:40:59,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:40:59,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:40:59,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:40:59,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:40:59,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:40:59,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:40:59,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:40:59,659 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:40:59,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:40:59,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:40:59,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:40:59,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:40:59,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:40:59,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:40:59,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:40:59,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:40:59,663 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:40:59,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:40:59,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:40:59,664 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:40:59,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:40:59,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:40:59,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:40:59,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:40:59,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:40:59,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:40:59,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:40:59,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:40:59,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:40:59,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:40:59,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:40:59,668 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:40:59,668 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:40:59,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:40:59,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:40:59,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:40:59,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:40:59,669 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:40:59,669 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 -> fe7400f0b0ab4fdd8aedde72286ef8e424ee02ac98a8a7a44d0658bd5103a03f [2024-10-13 03:40:59,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:40:59,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:40:59,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:40:59,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:40:59,974 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:40:59,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-13 03:41:01,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:41:01,753 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:41:01,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-13 03:41:01,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee03cc6fb/d5e7a0742edb479086f3b636b1f53488/FLAG5d5fec47c [2024-10-13 03:41:01,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee03cc6fb/d5e7a0742edb479086f3b636b1f53488 [2024-10-13 03:41:01,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:41:01,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:41:01,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:01,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:41:01,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:41:01,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:01" (1/1) ... [2024-10-13 03:41:01,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f2946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:01, skipping insertion in model container [2024-10-13 03:41:01,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:01" (1/1) ... [2024-10-13 03:41:01,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:41:01,984 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-10-13 03:41:02,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:02,059 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:41:02,073 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_floatingpointinfluence_no-floats_file-81.i[916,929] [2024-10-13 03:41:02,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:02,135 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:41:02,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02 WrapperNode [2024-10-13 03:41:02,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:02,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:02,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:41:02,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:41:02,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,197 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-13 03:41:02,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:02,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:41:02,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:41:02,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:41:02,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,233 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 03:41:02,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:41:02,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:41:02,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:41:02,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:41:02,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (1/1) ... [2024-10-13 03:41:02,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:02,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:41:02,294 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 03:41:02,304 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 03:41:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:41:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:41:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:41:02,342 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:41:02,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:41:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:41:02,417 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:41:02,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:41:02,688 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:41:02,688 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:41:02,739 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:41:02,739 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:41:02,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:02 BoogieIcfgContainer [2024-10-13 03:41:02,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:41:02,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:41:02,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:41:02,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:41:02,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:41:01" (1/3) ... [2024-10-13 03:41:02,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553e4fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:02, skipping insertion in model container [2024-10-13 03:41:02,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:02" (2/3) ... [2024-10-13 03:41:02,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553e4fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:02, skipping insertion in model container [2024-10-13 03:41:02,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:02" (3/3) ... [2024-10-13 03:41:02,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-81.i [2024-10-13 03:41:02,764 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:41:02,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:41:02,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:41:02,846 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;@2dcd18e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:41:02,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:41:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:41:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 03:41:02,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:02,868 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:02,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:02,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash -507814785, now seen corresponding path program 1 times [2024-10-13 03:41:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:41:02,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46677642] [2024-10-13 03:41:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:02,892 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 03:41:02,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:41:02,895 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 03:41:02,896 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 03:41:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:03,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:41:03,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:41:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2024-10-13 03:41:03,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:41:03,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:41:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46677642] [2024-10-13 03:41:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46677642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:41:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661679077] [2024-10-13 03:41:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:03,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:41:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:41:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:41:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:41:03,243 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:41:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:03,289 INFO L93 Difference]: Finished difference Result 105 states and 188 transitions. [2024-10-13 03:41:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:41:03,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 132 [2024-10-13 03:41:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:03,299 INFO L225 Difference]: With dead ends: 105 [2024-10-13 03:41:03,299 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 03:41:03,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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 03:41:03,305 INFO L432 NwaCegarLoop]: 76 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, 76 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 03:41:03,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:41:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 03:41:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 03:41:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:41:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-13 03:41:03,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 132 [2024-10-13 03:41:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:03,340 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-13 03:41:03,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:41:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-13 03:41:03,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-13 03:41:03,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:03,343 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:03,351 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 03:41:03,544 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 03:41:03,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:03,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash -189098561, now seen corresponding path program 1 times [2024-10-13 03:41:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:41:03,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288758370] [2024-10-13 03:41:03,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:03,546 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 03:41:03,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:41:03,551 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 03:41:03,552 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 03:41:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:03,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 03:41:03,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:41:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:41:04,371 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:41:04,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:41:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288758370] [2024-10-13 03:41:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288758370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:41:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170934141] [2024-10-13 03:41:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:04,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:41:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:41:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:41:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:41:04,379 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:41:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:04,593 INFO L93 Difference]: Finished difference Result 155 states and 236 transitions. [2024-10-13 03:41:04,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:41:04,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 132 [2024-10-13 03:41:04,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:04,596 INFO L225 Difference]: With dead ends: 155 [2024-10-13 03:41:04,596 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 03:41:04,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:41:04,600 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:41:04,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 247 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:41:04,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 03:41:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 91. [2024-10-13 03:41:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:41:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-10-13 03:41:04,633 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 132 [2024-10-13 03:41:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:04,634 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-10-13 03:41:04,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:41:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-10-13 03:41:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 03:41:04,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:04,643 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:04,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 03:41:04,843 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 03:41:04,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:04,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:04,845 INFO L85 PathProgramCache]: Analyzing trace with hash -737199260, now seen corresponding path program 1 times [2024-10-13 03:41:04,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:41:04,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164501470] [2024-10-13 03:41:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:04,846 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 03:41:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:41:04,849 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 03:41:04,850 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 03:41:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:04,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 03:41:04,936 INFO L278 TraceCheckSpWp]: Computing forward predicates...