./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:05:51,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:05:51,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:05:51,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:05:51,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:05:51,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:05:51,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:05:51,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:05:51,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:05:51,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:05:51,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:05:51,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:05:51,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:05:51,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:05:51,593 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:05:51,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:05:51,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:05:51,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:05:51,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:05:51,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:05:51,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:05:51,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:05:51,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:05:51,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:05:51,598 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:05:51,598 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:05:51,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:05:51,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:05:51,599 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:05:51,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:05:51,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:05:51,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:05:51,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:05:51,600 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:05:51,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:05:51,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:05:51,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:05:51,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:05:51,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:05:51,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:05:51,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:05:51,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:05:51,601 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa [2024-11-16 18:05:51,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:05:51,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:05:51,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:05:51,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:05:51,826 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:05:51,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i [2024-11-16 18:05:53,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:05:53,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:05:53,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i [2024-11-16 18:05:53,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f253943ad/2b1459603df3450990b54b202da7cde0/FLAG351a30505 [2024-11-16 18:05:53,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f253943ad/2b1459603df3450990b54b202da7cde0 [2024-11-16 18:05:53,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:05:53,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:05:53,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:05:53,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:05:53,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:05:53,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427a0533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53, skipping insertion in model container [2024-11-16 18:05:53,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:05:53,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i[913,926] [2024-11-16 18:05:53,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:05:53,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:05:53,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i[913,926] [2024-11-16 18:05:53,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:05:53,878 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:05:53,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53 WrapperNode [2024-11-16 18:05:53,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:05:53,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:05:53,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:05:53,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:05:53,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,915 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-16 18:05:53,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:05:53,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:05:53,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:05:53,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:05:53,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,937 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:05:53,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:05:53,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:05:53,947 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:05:53,947 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:05:53,948 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (1/1) ... [2024-11-16 18:05:53,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:05:53,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:05:53,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:05:53,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:05:54,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:05:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:05:54,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:05:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:05:54,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:05:54,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:05:54,069 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:05:54,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:05:54,279 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: havoc property_#t~bitwise12#1;havoc property_#t~short13#1; [2024-11-16 18:05:54,300 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 18:05:54,300 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:05:54,313 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:05:54,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:05:54,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:05:54 BoogieIcfgContainer [2024-11-16 18:05:54,314 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:05:54,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:05:54,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:05:54,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:05:54,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:05:53" (1/3) ... [2024-11-16 18:05:54,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:05:54, skipping insertion in model container [2024-11-16 18:05:54,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:05:53" (2/3) ... [2024-11-16 18:05:54,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:05:54, skipping insertion in model container [2024-11-16 18:05:54,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:05:54" (3/3) ... [2024-11-16 18:05:54,319 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-79.i [2024-11-16 18:05:54,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:05:54,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:05:54,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:05:54,377 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;@28af799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:05:54,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:05:54,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:05:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 18:05:54,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:54,387 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:05:54,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:54,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1117448503, now seen corresponding path program 1 times [2024-11-16 18:05:54,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:05:54,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540082616] [2024-11-16 18:05:54,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:05:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:05:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:05:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:05:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:05:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:05:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:05:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:05:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:05:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:05:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:05:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 18:05:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:05:54,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:05:54,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540082616] [2024-11-16 18:05:54,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540082616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:54,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:54,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:05:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596792849] [2024-11-16 18:05:54,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:54,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:05:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:05:54,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:05:54,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:05:54,629 INFO L87 Difference]: Start difference. First operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:05:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:54,653 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2024-11-16 18:05:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:05:54,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 81 [2024-11-16 18:05:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:54,660 INFO L225 Difference]: With dead ends: 102 [2024-11-16 18:05:54,660 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 18:05:54,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:05:54,664 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:54,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:05:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 18:05:54,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-16 18:05:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:05:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2024-11-16 18:05:54,703 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 81 [2024-11-16 18:05:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:54,703 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2024-11-16 18:05:54,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:05:54,703 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2024-11-16 18:05:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-16 18:05:54,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:54,706 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:05:54,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:05:54,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:54,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash 871527206, now seen corresponding path program 1 times [2024-11-16 18:05:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:05:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483158338] [2024-11-16 18:05:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:05:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:05:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:05:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:05:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:05:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:05:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:05:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:05:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:05:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:05:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:05:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 18:05:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:54,958 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:05:54,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:05:54,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483158338] [2024-11-16 18:05:54,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483158338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:54,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:54,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:05:54,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915648642] [2024-11-16 18:05:54,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:54,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:05:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:05:54,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:05:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:05:54,962 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:05:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:55,016 INFO L93 Difference]: Finished difference Result 142 states and 197 transitions. [2024-11-16 18:05:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:05:55,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2024-11-16 18:05:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:55,019 INFO L225 Difference]: With dead ends: 142 [2024-11-16 18:05:55,020 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 18:05:55,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:05:55,022 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 60 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:55,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 290 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:05:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 18:05:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 52. [2024-11-16 18:05:55,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:05:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-11-16 18:05:55,035 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 81 [2024-11-16 18:05:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:55,037 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-11-16 18:05:55,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:05:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-11-16 18:05:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 18:05:55,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:55,040 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:05:55,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:05:55,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:55,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:55,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1593575994, now seen corresponding path program 1 times [2024-11-16 18:05:55,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:05:55,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732416281] [2024-11-16 18:05:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:05:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:05:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:05:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:05:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:05:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:05:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:05:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:05:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:05:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:05:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:05:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 18:05:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:05:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:05:55,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732416281] [2024-11-16 18:05:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732416281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:05:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520766638] [2024-11-16 18:05:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:55,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:05:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:05:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:05:55,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:05:55,248 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:05:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:55,379 INFO L93 Difference]: Finished difference Result 147 states and 201 transitions. [2024-11-16 18:05:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:05:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 82 [2024-11-16 18:05:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:55,382 INFO L225 Difference]: With dead ends: 147 [2024-11-16 18:05:55,384 INFO L226 Difference]: Without dead ends: 98 [2024-11-16 18:05:55,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:05:55,385 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 64 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:55,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 228 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:05:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-16 18:05:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 50. [2024-11-16 18:05:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:05:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2024-11-16 18:05:55,393 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 82 [2024-11-16 18:05:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:55,393 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2024-11-16 18:05:55,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:05:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2024-11-16 18:05:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 18:05:55,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:55,396 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:05:55,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:05:55,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:55,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash 170445032, now seen corresponding path program 1 times [2024-11-16 18:05:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:05:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186498302] [2024-11-16 18:05:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:05:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:05:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:05:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:05:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:05:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:05:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:05:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:05:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:05:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:05:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:05:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 18:05:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 18:05:55,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:05:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186498302] [2024-11-16 18:05:55,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186498302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:55,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:55,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:05:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315855797] [2024-11-16 18:05:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:55,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:05:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:05:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:05:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:05:55,840 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:05:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:55,950 INFO L93 Difference]: Finished difference Result 103 states and 136 transitions. [2024-11-16 18:05:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:05:55,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 83 [2024-11-16 18:05:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:55,955 INFO L225 Difference]: With dead ends: 103 [2024-11-16 18:05:55,955 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 18:05:55,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:05:55,956 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:55,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 130 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:05:55,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 18:05:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-11-16 18:05:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:05:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-11-16 18:05:55,964 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 83 [2024-11-16 18:05:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:55,965 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-11-16 18:05:55,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:05:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-11-16 18:05:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-16 18:05:55,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:55,966 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:05:55,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:05:55,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:55,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1725371652, now seen corresponding path program 1 times [2024-11-16 18:05:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:05:55,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065991516] [2024-11-16 18:05:55,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:55,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:05:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:05:55,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548439802] [2024-11-16 18:05:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:55,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:05:55,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:05:55,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:05:55,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:05:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:05:56,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:05:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:05:56,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:05:56,146 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:05:56,147 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:05:56,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:05:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:05:56,352 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 18:05:56,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:05:56,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:05:56 BoogieIcfgContainer [2024-11-16 18:05:56,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:05:56,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:05:56,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:05:56,410 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:05:56,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:05:54" (3/4) ... [2024-11-16 18:05:56,412 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:05:56,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:05:56,413 INFO L158 Benchmark]: Toolchain (without parser) took 2810.55ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 85.6MB in the beginning and 151.9MB in the end (delta: -66.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:05:56,415 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 109.3MB in the end (delta: 105.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:05:56,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.00ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 71.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 18:05:56,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.62ms. Allocated memory is still 155.2MB. Free memory was 71.2MB in the beginning and 69.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:05:56,416 INFO L158 Benchmark]: Boogie Preprocessor took 30.48ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 66.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:05:56,416 INFO L158 Benchmark]: IcfgBuilder took 366.78ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 114.4MB in the end (delta: -47.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 18:05:56,416 INFO L158 Benchmark]: TraceAbstraction took 2091.88ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 113.9MB in the beginning and 153.0MB in the end (delta: -39.1MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. [2024-11-16 18:05:56,416 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 192.9MB. Free memory was 153.0MB in the beginning and 151.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:05:56,417 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 155.2MB. Free memory was 109.4MB in the beginning and 109.3MB in the end (delta: 105.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.00ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 71.2MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.62ms. Allocated memory is still 155.2MB. Free memory was 71.2MB in the beginning and 69.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.48ms. Allocated memory is still 155.2MB. Free memory was 69.0MB in the beginning and 66.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 366.78ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 114.4MB in the end (delta: -47.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2091.88ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 113.9MB in the beginning and 153.0MB in the end (delta: -39.1MB). Peak memory consumption was 96.8MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 192.9MB. Free memory was 153.0MB in the beginning and 151.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed char var_1_3 = 0; [L24] signed char var_1_4 = 64; [L25] signed char var_1_5 = 64; [L26] signed long int var_1_6 = -64; [L27] double var_1_8 = 32.5; [L28] double var_1_9 = 1.6; [L29] unsigned short int var_1_10 = 32; [L30] float var_1_11 = 15.5; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L66] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L67] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L67] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L68] var_1_4 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L69] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L70] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L70] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L71] var_1_5 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L73] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L73] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_8=65/2, var_1_9=8/5] [L74] var_1_8 = __VERIFIER_nondet_double() [L75] 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_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_9=8/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_9=8/5] [L75] 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_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64, var_1_9=8/5] [L76] var_1_9 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=31/2, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L78] var_1_11 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L79] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L80] var_1_13 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L81] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L82] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L82] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L96] RET updateVariables() [L97] CALL step() [L37] signed long int stepLocal_0 = (((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=33, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L38] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=33, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=-64] [L38] COND FALSE !(stepLocal_0 <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) [L45] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L47] signed long int stepLocal_1 = var_1_5 + var_1_6; VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L48] COND FALSE !(var_1_11 < var_1_9) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L56] COND TRUE ! var_1_12 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L57] COND TRUE ! var_1_12 [L58] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=66, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L88] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L88] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L88-L89] return ((((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5)))) && ((var_1_11 < var_1_9) ? (((var_1_5 + var_1_6) <= (~ (var_1_6 % -32))) ? (var_1_10 == ((unsigned short int) var_1_5)) : (var_1_10 == ((unsigned short int) var_1_5))) : 1)) && (var_1_12 == ((unsigned char) var_1_13)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_12=0, var_1_13=0, var_1_1=-32, var_1_3=0, var_1_4=-1, var_1_5=33, var_1_6=33] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 715 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 409 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 306 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 93 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 880/880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:05:56,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:05:58,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:05:58,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:05:58,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:05:58,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:05:58,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:05:58,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:05:58,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:05:58,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:05:58,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:05:58,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:05:58,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:05:58,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:05:58,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:05:58,281 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:05:58,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:05:58,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:05:58,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:05:58,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:05:58,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:05:58,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:05:58,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:05:58,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:05:58,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:05:58,286 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:05:58,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:05:58,286 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:05:58,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:05:58,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:05:58,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:05:58,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:05:58,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:05:58,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:05:58,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:05:58,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:05:58,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:05:58,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:05:58,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:05:58,287 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:05:58,288 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:05:58,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:05:58,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:05:58,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:05:58,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:05:58,290 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3427cd04e63c47ddeaec1dc1bec16a594ae04a31865909e3272379057690f9aa [2024-11-16 18:05:58,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:05:58,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:05:58,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:05:58,573 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:05:58,573 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:05:58,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i [2024-11-16 18:05:59,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:05:59,983 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:05:59,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i [2024-11-16 18:05:59,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534fb9009/bb8307db11e74325a3a44f2cdf6c37a3/FLAGb00504dec [2024-11-16 18:06:00,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/534fb9009/bb8307db11e74325a3a44f2cdf6c37a3 [2024-11-16 18:06:00,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:06:00,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:06:00,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:06:00,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:06:00,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:06:00,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7282cc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00, skipping insertion in model container [2024-11-16 18:06:00,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:06:00,561 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i[913,926] [2024-11-16 18:06:00,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:06:00,622 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:06:00,631 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-79.i[913,926] [2024-11-16 18:06:00,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:06:00,674 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:06:00,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00 WrapperNode [2024-11-16 18:06:00,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:06:00,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:06:00,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:06:00,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:06:00,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,716 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-16 18:06:00,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:06:00,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:06:00,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:06:00,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:06:00,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:06:00,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,756 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:06:00,766 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:06:00,766 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:06:00,766 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:06:00,767 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (1/1) ... [2024-11-16 18:06:00,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:06:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:06:00,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:06:00,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:06:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:06:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:06:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:06:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:06:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:06:00,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:06:00,895 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:06:00,896 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:06:01,216 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 18:06:01,216 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:06:01,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:06:01,229 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:06:01,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:06:01 BoogieIcfgContainer [2024-11-16 18:06:01,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:06:01,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:06:01,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:06:01,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:06:01,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:06:00" (1/3) ... [2024-11-16 18:06:01,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161233b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:06:01, skipping insertion in model container [2024-11-16 18:06:01,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:06:00" (2/3) ... [2024-11-16 18:06:01,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161233b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:06:01, skipping insertion in model container [2024-11-16 18:06:01,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:06:01" (3/3) ... [2024-11-16 18:06:01,240 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-79.i [2024-11-16 18:06:01,254 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:06:01,255 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:06:01,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:06:01,316 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;@5d52041a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:06:01,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:06:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:06:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-16 18:06:01,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:06:01,330 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:06:01,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:06:01,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:06:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1045521320, now seen corresponding path program 1 times [2024-11-16 18:06:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:06:01,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882296911] [2024-11-16 18:06:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:06:01,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:06:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:06:01,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:06:01,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:06:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:06:01,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:06:01,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:06:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-16 18:06:01,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:06:01,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:06:01,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882296911] [2024-11-16 18:06:01,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882296911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:06:01,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:06:01,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:06:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238752377] [2024-11-16 18:06:01,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:06:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:06:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:06:01,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:06:01,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:06:01,535 INFO L87 Difference]: Start difference. First operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:06:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:06:01,552 INFO L93 Difference]: Finished difference Result 88 states and 138 transitions. [2024-11-16 18:06:01,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:06:01,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2024-11-16 18:06:01,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:06:01,558 INFO L225 Difference]: With dead ends: 88 [2024-11-16 18:06:01,558 INFO L226 Difference]: Without dead ends: 43 [2024-11-16 18:06:01,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:06:01,563 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:06:01,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:06:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-16 18:06:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-16 18:06:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:06:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-16 18:06:01,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 78 [2024-11-16 18:06:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:06:01,599 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-16 18:06:01,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:06:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-16 18:06:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-16 18:06:01,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:06:01,604 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:06:01,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:06:01,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:06:01,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:06:01,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:06:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash -294329061, now seen corresponding path program 1 times [2024-11-16 18:06:01,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:06:01,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238058029] [2024-11-16 18:06:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:06:01,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:06:01,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:06:01,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:06:01,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:06:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:06:01,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:06:01,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:06:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 18:06:02,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:06:02,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:06:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238058029] [2024-11-16 18:06:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238058029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:06:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:06:02,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:06:02,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645957780] [2024-11-16 18:06:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:06:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:06:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:06:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:06:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:06:02,019 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:06:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:06:02,282 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2024-11-16 18:06:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:06:02,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-16 18:06:02,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:06:02,288 INFO L225 Difference]: With dead ends: 89 [2024-11-16 18:06:02,288 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 18:06:02,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:06:02,289 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 70 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:06:02,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 99 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:06:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 18:06:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2024-11-16 18:06:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:06:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-11-16 18:06:02,302 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 78 [2024-11-16 18:06:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:06:02,302 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-16 18:06:02,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:06:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2024-11-16 18:06:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-16 18:06:02,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:06:02,304 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:06:02,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 18:06:02,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:06:02,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:06:02,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:06:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1391233206, now seen corresponding path program 1 times [2024-11-16 18:06:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:06:02,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258330048] [2024-11-16 18:06:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:06:02,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:06:02,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:06:02,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:06:02,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:06:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:06:02,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 18:06:02,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:06:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 114 proven. 18 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-16 18:06:45,267 INFO L311 TraceCheckSpWp]: Computing backward predicates...