./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:08:39,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:08:39,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:08:39,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:08:39,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:08:39,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:08:39,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:08:39,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:08:39,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:08:39,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:08:39,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:08:39,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:08:39,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:08:39,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:08:39,378 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:08:39,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:08:39,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:08:39,379 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:08:39,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:08:39,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:08:39,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:08:39,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:08:39,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:08:39,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:08:39,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:08:39,383 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:08:39,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:08:39,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:08:39,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:08:39,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:08:39,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:08:39,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:08:39,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:39,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:08:39,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:08:39,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:08:39,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:08:39,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:08:39,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:08:39,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:08:39,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:08:39,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:08:39,388 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-clean/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-clean/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 -> 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 [2024-10-11 13:08:39,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:08:39,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:08:39,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:08:39,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:08:39,652 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:08:39,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2024-10-11 13:08:41,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:08:41,341 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:08:41,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2024-10-11 13:08:41,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2da87b65d/0081c25c88b1431baba8f3734b4b8254/FLAG90ed7ec0a [2024-10-11 13:08:41,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2da87b65d/0081c25c88b1431baba8f3734b4b8254 [2024-10-11 13:08:41,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:08:41,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:08:41,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:41,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:08:41,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:08:41,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5febdd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41, skipping insertion in model container [2024-10-11 13:08:41,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:08:41,577 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i[913,926] [2024-10-11 13:08:41,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:41,633 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:08:41,644 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i[913,926] [2024-10-11 13:08:41,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:41,681 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:08:41,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41 WrapperNode [2024-10-11 13:08:41,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:41,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:41,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:08:41,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:08:41,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,729 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-11 13:08:41,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:41,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:08:41,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:08:41,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:08:41,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,761 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-11 13:08:41,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,763 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:08:41,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:08:41,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:08:41,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:08:41,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (1/1) ... [2024-10-11 13:08:41,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:41,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:41,822 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:08:41,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:08:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:08:41,872 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:08:41,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:08:41,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:08:41,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:08:41,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:08:41,973 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:08:41,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:08:42,311 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 13:08:42,311 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:08:42,351 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:08:42,352 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:08:42,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:42 BoogieIcfgContainer [2024-10-11 13:08:42,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:08:42,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:08:42,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:08:42,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:08:42,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:08:41" (1/3) ... [2024-10-11 13:08:42,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e9d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:42, skipping insertion in model container [2024-10-11 13:08:42,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:41" (2/3) ... [2024-10-11 13:08:42,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69e9d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:08:42, skipping insertion in model container [2024-10-11 13:08:42,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:42" (3/3) ... [2024-10-11 13:08:42,362 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-64.i [2024-10-11 13:08:42,374 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:08:42,374 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:08:42,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:08:42,462 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;@5b499449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:08:42,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:08:42,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:08:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:08:42,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:42,507 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:08:42,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:42,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash -447702071, now seen corresponding path program 1 times [2024-10-11 13:08:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:42,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583983630] [2024-10-11 13:08:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:08:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:08:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:08:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:08:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:08:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:08:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 13:08:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:08:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:08:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:08:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 13:08:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 13:08:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 13:08:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 13:08:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:08:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:08:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 13:08:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 13:08:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 13:08:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:08:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:08:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:08:42,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583983630] [2024-10-11 13:08:42,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583983630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:42,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:08:42,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895708503] [2024-10-11 13:08:42,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:08:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:08:42,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:08:42,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:08:42,990 INFO L87 Difference]: Start difference. First operand has 62 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:08:43,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:43,032 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2024-10-11 13:08:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:08:43,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-10-11 13:08:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:43,045 INFO L225 Difference]: With dead ends: 121 [2024-10-11 13:08:43,046 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 13:08:43,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11 13:08:43,056 INFO L432 NwaCegarLoop]: 89 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, 89 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-11 13:08:43,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:08:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 13:08:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 13:08:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:08:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 92 transitions. [2024-10-11 13:08:43,109 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 92 transitions. Word has length 124 [2024-10-11 13:08:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:43,109 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 92 transitions. [2024-10-11 13:08:43,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:08:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 92 transitions. [2024-10-11 13:08:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:08:43,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:43,117 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:08:43,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:08:43,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:43,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:43,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1637600125, now seen corresponding path program 1 times [2024-10-11 13:08:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:43,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979923628] [2024-10-11 13:08:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:43,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:08:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:08:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:08:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:08:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:08:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:08:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 13:08:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:08:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:08:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:08:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 13:08:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 13:08:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 13:08:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 13:08:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:08:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:08:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 13:08:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 13:08:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 13:08:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:08:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:08:44,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:08:44,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979923628] [2024-10-11 13:08:44,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979923628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:08:44,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:08:44,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:08:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649498527] [2024-10-11 13:08:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:08:44,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:08:44,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:08:44,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:08:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:08:44,641 INFO L87 Difference]: Start difference. First operand 60 states and 92 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:08:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:45,505 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2024-10-11 13:08:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:08:45,508 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2024-10-11 13:08:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:45,512 INFO L225 Difference]: With dead ends: 287 [2024-10-11 13:08:45,513 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 13:08:45,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:08:45,515 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 268 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:45,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 488 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:08:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 13:08:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 71. [2024-10-11 13:08:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:08:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-10-11 13:08:45,542 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 124 [2024-10-11 13:08:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:45,543 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-10-11 13:08:45,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:08:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-10-11 13:08:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:08:45,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:45,548 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:08:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:08:45,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1244573115, now seen corresponding path program 1 times [2024-10-11 13:08:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:45,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831484962] [2024-10-11 13:08:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:08:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:08:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:08:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:08:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:08:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:08:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 13:08:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:08:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:08:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:08:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 13:08:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 13:08:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 13:08:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 13:08:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:08:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:08:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 13:08:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 13:08:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 13:08:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:08:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 13:08:46,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:08:46,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831484962] [2024-10-11 13:08:46,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831484962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:08:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825020891] [2024-10-11 13:08:46,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:46,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:08:46,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:46,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:08:46,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:08:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:08:46,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 13:08:46,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:08:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 429 proven. 39 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-11 13:08:49,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:08:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 69 proven. 42 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-10-11 13:08:50,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825020891] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:08:50,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 13:08:50,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 28 [2024-10-11 13:08:50,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040366090] [2024-10-11 13:08:50,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 13:08:50,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 13:08:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:08:50,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 13:08:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-10-11 13:08:50,795 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-11 13:08:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:08:52,897 INFO L93 Difference]: Finished difference Result 290 states and 419 transitions. [2024-10-11 13:08:52,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-11 13:08:52,901 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 124 [2024-10-11 13:08:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:08:52,903 INFO L225 Difference]: With dead ends: 290 [2024-10-11 13:08:52,903 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 13:08:52,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=656, Invalid=2766, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 13:08:52,908 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 519 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:08:52,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 823 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 13:08:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 13:08:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 175. [2024-10-11 13:08:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 117 states have internal predecessors, (151), 51 states have call successors, (51), 7 states have call predecessors, (51), 7 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 13:08:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2024-10-11 13:08:52,944 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 124 [2024-10-11 13:08:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:08:52,946 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2024-10-11 13:08:52,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2857142857142856) internal successors, (92), 28 states have internal predecessors, (92), 8 states have call successors, (60), 4 states have call predecessors, (60), 9 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-10-11 13:08:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2024-10-11 13:08:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 13:08:52,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:08:52,950 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:08:52,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:08:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:08:53,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:08:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:08:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash -645913840, now seen corresponding path program 1 times [2024-10-11 13:08:53,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:08:53,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498402012] [2024-10-11 13:08:53,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:53,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:08:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:08:53,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421072840] [2024-10-11 13:08:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:08:53,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:08:53,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:53,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:08:53,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:08:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:08:53,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:08:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:08:53,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:08:53,526 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:08:53,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:08:53,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:08:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:08:53,738 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 13:08:53,821 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:08:53,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:08:53 BoogieIcfgContainer [2024-10-11 13:08:53,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:08:53,824 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:08:53,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:08:53,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:08:53,825 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:08:42" (3/4) ... [2024-10-11 13:08:53,830 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:08:53,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:08:53,832 INFO L158 Benchmark]: Toolchain (without parser) took 12462.23ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 122.3MB in the beginning and 173.4MB in the end (delta: -51.1MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2024-10-11 13:08:53,832 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory was 83.7MB in the beginning and 83.5MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:08:53,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.96ms. Allocated memory is still 155.2MB. Free memory was 121.6MB in the beginning and 107.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:08:53,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.83ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 104.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:08:53,833 INFO L158 Benchmark]: Boogie Preprocessor took 49.13ms. Allocated memory is still 155.2MB. Free memory was 104.2MB in the beginning and 101.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:08:53,833 INFO L158 Benchmark]: RCFGBuilder took 572.89ms. Allocated memory is still 155.2MB. Free memory was 101.3MB in the beginning and 79.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 13:08:53,833 INFO L158 Benchmark]: TraceAbstraction took 11469.11ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 79.1MB in the beginning and 173.4MB in the end (delta: -94.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-11 13:08:53,834 INFO L158 Benchmark]: Witness Printer took 7.04ms. Allocated memory is still 270.5MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:08:53,835 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.15ms. Allocated memory is still 121.6MB. Free memory was 83.7MB in the beginning and 83.5MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.96ms. Allocated memory is still 155.2MB. Free memory was 121.6MB in the beginning and 107.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.83ms. Allocated memory is still 155.2MB. Free memory was 107.4MB in the beginning and 104.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.13ms. Allocated memory is still 155.2MB. Free memory was 104.2MB in the beginning and 101.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 572.89ms. Allocated memory is still 155.2MB. Free memory was 101.3MB in the beginning and 79.7MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11469.11ms. Allocated memory was 155.2MB in the beginning and 270.5MB in the end (delta: 115.3MB). Free memory was 79.1MB in the beginning and 173.4MB in the end (delta: -94.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 7.04ms. Allocated memory is still 270.5MB. Free memory is still 173.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.9; [L23] unsigned long int var_1_2 = 128; [L24] unsigned long int var_1_3 = 2941876006; [L25] unsigned long int var_1_5 = 256; [L26] float var_1_6 = 63.5; [L27] float var_1_7 = -0.151; [L28] float var_1_8 = 0.8; [L29] double var_1_9 = 9.5; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] unsigned char var_1_12 = 0; [L33] signed short int var_1_13 = -2; [L34] unsigned char var_1_16 = 10; [L35] unsigned short int var_1_17 = 8; [L36] unsigned char var_1_18 = 16; [L37] unsigned char last_1_var_1_16 = 10; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] CALL updateLastVariables() [L105] last_1_var_1_16 = var_1_16 [L115] RET updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2941876006, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L75] var_1_3 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=256, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L78] var_1_5 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L79] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L80] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L81] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_6=127/2, var_1_8=4/5, var_1_9=19/2] [L82] var_1_6 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L84] var_1_7 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_8=4/5, var_1_9=19/2] [L86] var_1_8 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=19/2] [L87] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=19/2] [L88] var_1_9 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L90] var_1_11 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L91] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L92] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L92] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L93] var_1_12 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L94] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L95] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L95] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=8, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L96] var_1_17 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L98] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L98] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L99] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L99] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=16, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L100] var_1_18 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L102] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L102] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L116] RET updateVariables() [L117] CALL step() [L41] signed long int stepLocal_1 = last_1_var_1_16; [L42] unsigned long int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, stepLocal_1=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L43] COND TRUE stepLocal_1 <= (var_1_3 - last_1_var_1_16) VAL [isInitial=1, last_1_var_1_16=10, stepLocal_0=2147483647, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=9/10, var_1_3=2147483647, var_1_5=-4294967294] [L44] COND FALSE !(stepLocal_0 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) [L49] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L52] COND TRUE var_1_1 < var_1_1 [L53] var_1_10 = (! (var_1_11 && var_1_12)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L55] EXPR var_1_2 & (var_1_5 / var_1_17) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=10, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L55] unsigned long int stepLocal_2 = var_1_2 & (var_1_5 / var_1_17); [L56] COND FALSE !(stepLocal_2 > var_1_3) [L63] var_1_16 = var_1_18 VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L108-L109] return ((((last_1_var_1_16 <= (var_1_3 - last_1_var_1_16)) ? ((var_1_3 < (((((last_1_var_1_16 / var_1_5)) > (last_1_var_1_16)) ? ((last_1_var_1_16 / var_1_5)) : (last_1_var_1_16)))) ? (((var_1_6 + var_1_7) > var_1_8) ? (var_1_1 == ((double) var_1_9)) : 1) : (var_1_1 == ((double) var_1_9))) : 1) && ((var_1_1 < var_1_1) ? (var_1_10 == ((unsigned char) (! (var_1_11 && var_1_12)))) : 1)) && (var_1_10 ? ((var_1_12 || (var_1_1 < (var_1_1 * var_1_1))) ? (var_1_13 == ((signed short int) (var_1_16 + var_1_16))) : 1) : 1)) && (((var_1_2 & (var_1_5 / var_1_17)) > var_1_3) ? ((! var_1_10) ? (var_1_16 == ((unsigned char) var_1_18)) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_18))) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=10, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-2, var_1_16=0, var_1_17=-65533, var_1_18=0, var_1_1=2, var_1_2=0, var_1_3=2147483647, var_1_5=-4294967294, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 787 mSDsluCounter, 1400 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1129 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1524 IncrementalHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 271 mSDtfsCounter, 1524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=3, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 202 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 746 NumberOfCodeBlocks, 746 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 3726 SizeOfPredicates, 10 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 3668/3800 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-11 13:08:53,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:08:56,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:08:56,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:08:56,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:08:56,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:08:56,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:08:56,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:08:56,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:08:56,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:08:56,152 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:08:56,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:08:56,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:08:56,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:08:56,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:08:56,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:08:56,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:08:56,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:08:56,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:08:56,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:08:56,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:08:56,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:08:56,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:08:56,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:08:56,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:08:56,159 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:08:56,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:08:56,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:08:56,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:08:56,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:08:56,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:08:56,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:08:56,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:08:56,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:08:56,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:08:56,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:56,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:08:56,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:08:56,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:08:56,163 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:08:56,163 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:08:56,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:08:56,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:08:56,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:08:56,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:08:56,164 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:08:56,165 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-clean/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-clean/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 -> 9b08b530c256c0cc63e5a2f7b8d2405af05be94e0639ec5a05aeb4fd2eed5431 [2024-10-11 13:08:56,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:08:56,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:08:56,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:08:56,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:08:56,588 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:08:56,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2024-10-11 13:08:58,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:08:58,285 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:08:58,286 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i [2024-10-11 13:08:58,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50c37288d/2f534bbf461d4385ba95798621b77069/FLAG759aaaad2 [2024-10-11 13:08:58,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50c37288d/2f534bbf461d4385ba95798621b77069 [2024-10-11 13:08:58,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:08:58,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:08:58,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:58,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:08:58,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:08:58,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e534494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58, skipping insertion in model container [2024-10-11 13:08:58,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:08:58,552 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i[913,926] [2024-10-11 13:08:58,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:58,639 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:08:58,650 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-64.i[913,926] [2024-10-11 13:08:58,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:08:58,703 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:08:58,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58 WrapperNode [2024-10-11 13:08:58,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:08:58,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:58,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:08:58,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:08:58,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,766 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-11 13:08:58,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:08:58,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:08:58,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:08:58,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:08:58,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,804 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-11 13:08:58,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,820 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:08:58,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:08:58,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:08:58,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:08:58,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (1/1) ... [2024-10-11 13:08:58,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:08:58,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:08:58,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:08:58,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:08:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:08:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:08:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:08:58,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:08:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:08:58,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:08:59,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:08:59,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:09:01,834 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 13:09:01,835 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:09:01,886 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:09:01,887 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:09:01,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:09:01 BoogieIcfgContainer [2024-10-11 13:09:01,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:09:01,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:09:01,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:09:01,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:09:01,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:08:58" (1/3) ... [2024-10-11 13:09:01,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:09:01, skipping insertion in model container [2024-10-11 13:09:01,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:08:58" (2/3) ... [2024-10-11 13:09:01,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:09:01, skipping insertion in model container [2024-10-11 13:09:01,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:09:01" (3/3) ... [2024-10-11 13:09:01,897 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-64.i [2024-10-11 13:09:01,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:09:01,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:09:01,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:09:01,985 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;@2931bdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:09:01,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:09:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:09:02,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:09:02,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:02,002 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:09:02,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:02,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -757313963, now seen corresponding path program 1 times [2024-10-11 13:09:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:09:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154954262] [2024-10-11 13:09:02,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:02,024 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-11 13:09:02,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:09:02,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:09:02,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:09:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:02,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:09:02,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:09:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-11 13:09:02,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:09:02,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:09:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154954262] [2024-10-11 13:09:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154954262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:09:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:09:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:09:02,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191715371] [2024-10-11 13:09:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:09:02,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:09:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:09:02,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:09:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:09:02,613 INFO L87 Difference]: Start difference. First operand has 53 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:09:03,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:09:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:09:03,955 INFO L93 Difference]: Finished difference Result 103 states and 184 transitions. [2024-10-11 13:09:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:09:03,989 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 121 [2024-10-11 13:09:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:09:03,996 INFO L225 Difference]: With dead ends: 103 [2024-10-11 13:09:03,996 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 13:09:03,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-11 13:09:04,002 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:09:04,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 13:09:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 13:09:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 13:09:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:09:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2024-10-11 13:09:04,048 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 121 [2024-10-11 13:09:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:09:04,049 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2024-10-11 13:09:04,049 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:09:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2024-10-11 13:09:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:09:04,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:04,052 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:09:04,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:09:04,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:09:04,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:04,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -395390557, now seen corresponding path program 1 times [2024-10-11 13:09:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:09:04,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246701260] [2024-10-11 13:09:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:04,255 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-11 13:09:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:09:04,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:09:04,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:09:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:04,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:09:04,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:09:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:09:17,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:09:17,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:09:17,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246701260] [2024-10-11 13:09:17,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246701260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:09:17,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:09:17,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:09:17,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381419443] [2024-10-11 13:09:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:09:17,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:09:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:09:17,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:09:17,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:09:17,092 INFO L87 Difference]: Start difference. First operand 51 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:09:20,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:09:24,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:09:25,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:09:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:09:25,661 INFO L93 Difference]: Finished difference Result 169 states and 253 transitions. [2024-10-11 13:09:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:09:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-11 13:09:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:09:25,691 INFO L225 Difference]: With dead ends: 169 [2024-10-11 13:09:25,691 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 13:09:25,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:09:25,694 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 82 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:09:25,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 339 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-10-11 13:09:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 13:09:25,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2024-10-11 13:09:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:09:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 145 transitions. [2024-10-11 13:09:25,727 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 145 transitions. Word has length 121 [2024-10-11 13:09:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:09:25,728 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 145 transitions. [2024-10-11 13:09:25,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:09:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 145 transitions. [2024-10-11 13:09:25,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 13:09:25,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:25,730 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:09:25,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:09:25,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:09:25,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:25,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:25,936 INFO L85 PathProgramCache]: Analyzing trace with hash 618059733, now seen corresponding path program 1 times [2024-10-11 13:09:25,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:09:25,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879392899] [2024-10-11 13:09:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:25,938 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-11 13:09:25,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:09:25,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:09:25,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:09:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:26,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:09:26,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:09:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:09:27,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:09:27,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:09:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879392899] [2024-10-11 13:09:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879392899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:09:27,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:09:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:09:27,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502437156] [2024-10-11 13:09:27,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:09:27,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:09:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:09:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:09:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:09:27,410 INFO L87 Difference]: Start difference. First operand 96 states and 145 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:09:29,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:09:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:09:29,177 INFO L93 Difference]: Finished difference Result 148 states and 223 transitions. [2024-10-11 13:09:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:09:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2024-10-11 13:09:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:09:29,212 INFO L225 Difference]: With dead ends: 148 [2024-10-11 13:09:29,212 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 13:09:29,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:09:29,214 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:09:29,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 13:09:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 13:09:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-11 13:09:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:09:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2024-10-11 13:09:29,231 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 122 [2024-10-11 13:09:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:09:29,232 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2024-10-11 13:09:29,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:09:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2024-10-11 13:09:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 13:09:29,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:09:29,234 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:09:29,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:09:29,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:09:29,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:09:29,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:09:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash -446278544, now seen corresponding path program 1 times [2024-10-11 13:09:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:09:29,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981739706] [2024-10-11 13:09:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:09:29,437 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-11 13:09:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:09:29,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:09:29,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Waiting until timeout for monitored process [2024-10-11 13:09:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:09:29,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 13:09:29,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:09:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-11 13:09:47,087 INFO L311 TraceCheckSpWp]: Computing backward predicates...