./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.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_fillercode_fillercodesize_normal_file-4.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 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:38:07,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:38:07,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:38:07,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:38:07,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:38:07,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:38:07,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:38:07,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:38:07,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:38:07,795 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:38:07,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:38:07,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:38:07,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:38:07,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:38:07,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:38:07,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:38:07,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:38:07,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:38:07,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:38:07,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:38:07,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:38:07,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:38:07,802 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:38:07,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:38:07,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:38:07,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:38:07,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:38:07,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:38:07,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:38:07,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:38:07,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:38:07,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:38:07,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:38:07,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:38:07,804 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:38:07,804 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:38:07,804 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:38:07,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:38:07,805 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:38:07,805 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:38:07,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:38:07,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:38:07,807 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-11-16 12:38:08,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:38:08,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:38:08,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:38:08,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:38:08,060 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:38:08,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-11-16 12:38:09,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:38:09,583 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:38:09,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-11-16 12:38:09,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92d880a7/8e43dbad2d2b44b48fc7cfb90b80c937/FLAG5c6642d65 [2024-11-16 12:38:09,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f92d880a7/8e43dbad2d2b44b48fc7cfb90b80c937 [2024-11-16 12:38:09,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:38:09,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:38:09,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:38:09,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:38:09,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:38:09,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:09" (1/1) ... [2024-11-16 12:38:09,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0adb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:09, skipping insertion in model container [2024-11-16 12:38:09,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:09" (1/1) ... [2024-11-16 12:38:10,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:38:10,136 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-11-16 12:38:10,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:38:10,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:38:10,216 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-11-16 12:38:10,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:38:10,270 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:38:10,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10 WrapperNode [2024-11-16 12:38:10,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:38:10,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:38:10,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:38:10,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:38:10,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,324 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-11-16 12:38:10,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:38:10,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:38:10,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:38:10,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:38:10,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,359 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 12:38:10,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:38:10,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:38:10,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:38:10,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:38:10,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (1/1) ... [2024-11-16 12:38:10,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:38:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:38:10,407 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 12:38:10,411 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 12:38:10,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:38:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:38:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:38:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:38:10,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:38:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:38:10,585 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:38:10,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:38:10,922 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 12:38:10,926 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:38:10,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:38:10,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:38:10,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:38:10 BoogieIcfgContainer [2024-11-16 12:38:10,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:38:10,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:38:10,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:38:10,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:38:10,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:38:09" (1/3) ... [2024-11-16 12:38:10,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c0dd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:10, skipping insertion in model container [2024-11-16 12:38:10,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:10" (2/3) ... [2024-11-16 12:38:10,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c0dd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:10, skipping insertion in model container [2024-11-16 12:38:10,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:38:10" (3/3) ... [2024-11-16 12:38:10,954 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-4.i [2024-11-16 12:38:10,973 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:38:10,974 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:38:11,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:38:11,045 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;@49c028da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:38:11,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:38:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:38:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 12:38:11,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:11,059 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:11,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash -52729866, now seen corresponding path program 1 times [2024-11-16 12:38:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:11,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830254359] [2024-11-16 12:38:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:38:11,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:11,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830254359] [2024-11-16 12:38:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830254359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:38:11,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:38:11,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:38:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175332626] [2024-11-16 12:38:11,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:38:11,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:38:11,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:38:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:38:11,466 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:38:11,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:11,486 INFO L93 Difference]: Finished difference Result 126 states and 213 transitions. [2024-11-16 12:38:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:38:11,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2024-11-16 12:38:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:11,495 INFO L225 Difference]: With dead ends: 126 [2024-11-16 12:38:11,496 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 12:38:11,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:38:11,502 INFO L432 NwaCegarLoop]: 91 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, 91 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 12:38:11,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:38:11,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 12:38:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 12:38:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:38:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-16 12:38:11,555 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 131 [2024-11-16 12:38:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:11,559 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-16 12:38:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:38:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-16 12:38:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 12:38:11,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:11,562 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:11,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:38:11,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:11,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 913394995, now seen corresponding path program 1 times [2024-11-16 12:38:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419391142] [2024-11-16 12:38:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:38:12,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419391142] [2024-11-16 12:38:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419391142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:38:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:38:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:38:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999511693] [2024-11-16 12:38:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:38:12,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:38:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:38:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:38:12,417 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:12,641 INFO L93 Difference]: Finished difference Result 211 states and 304 transitions. [2024-11-16 12:38:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:38:12,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-16 12:38:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:12,644 INFO L225 Difference]: With dead ends: 211 [2024-11-16 12:38:12,644 INFO L226 Difference]: Without dead ends: 152 [2024-11-16 12:38:12,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:38:12,645 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 143 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:12,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 346 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:38:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-16 12:38:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2024-11-16 12:38:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 79 states have internal predecessors, (101), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 12:38:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2024-11-16 12:38:12,663 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 132 [2024-11-16 12:38:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:12,664 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 181 transitions. [2024-11-16 12:38:12,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 181 transitions. [2024-11-16 12:38:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 12:38:12,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:12,666 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:38:12,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:12,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash 942024146, now seen corresponding path program 1 times [2024-11-16 12:38:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869000249] [2024-11-16 12:38:12,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:38:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869000249] [2024-11-16 12:38:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869000249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:38:16,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:38:16,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:38:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065988206] [2024-11-16 12:38:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:38:16,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:38:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:16,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:38:16,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:38:16,627 INFO L87 Difference]: Start difference. First operand 122 states and 181 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:18,273 INFO L93 Difference]: Finished difference Result 409 states and 587 transitions. [2024-11-16 12:38:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:38:18,273 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-16 12:38:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:18,276 INFO L225 Difference]: With dead ends: 409 [2024-11-16 12:38:18,276 INFO L226 Difference]: Without dead ends: 290 [2024-11-16 12:38:18,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-16 12:38:18,280 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 208 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:18,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 491 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:38:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-16 12:38:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 190. [2024-11-16 12:38:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 125 states have (on average 1.248) internal successors, (156), 125 states have internal predecessors, (156), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 12:38:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions. [2024-11-16 12:38:18,316 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 132 [2024-11-16 12:38:18,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:18,317 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 276 transitions. [2024-11-16 12:38:18,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 276 transitions. [2024-11-16 12:38:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:38:18,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:18,321 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:18,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:38:18,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:18,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash -440970444, now seen corresponding path program 1 times [2024-11-16 12:38:18,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:18,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029226068] [2024-11-16 12:38:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:18,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 12:38:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029226068] [2024-11-16 12:38:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029226068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:38:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534001759] [2024-11-16 12:38:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:18,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:38:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:38:18,526 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 12:38:18,529 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 12:38:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:18,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 12:38:18,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:38:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-16 12:38:18,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:38:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 12:38:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534001759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:38:18,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:38:18,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 12:38:18,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769599292] [2024-11-16 12:38:18,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:38:18,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:38:18,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:18,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:38:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:38:18,970 INFO L87 Difference]: Start difference. First operand 190 states and 276 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-16 12:38:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:19,103 INFO L93 Difference]: Finished difference Result 331 states and 469 transitions. [2024-11-16 12:38:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:38:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 133 [2024-11-16 12:38:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:19,106 INFO L225 Difference]: With dead ends: 331 [2024-11-16 12:38:19,106 INFO L226 Difference]: Without dead ends: 207 [2024-11-16 12:38:19,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:38:19,111 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 34 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:19,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 138 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:38:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-16 12:38:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184. [2024-11-16 12:38:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 116 states have (on average 1.1293103448275863) internal successors, (131), 116 states have internal predecessors, (131), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 12:38:19,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2024-11-16 12:38:19,143 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 133 [2024-11-16 12:38:19,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:19,144 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2024-11-16 12:38:19,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-16 12:38:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2024-11-16 12:38:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:38:19,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:19,147 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:19,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 12:38:19,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:38:19,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:19,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 323427380, now seen corresponding path program 1 times [2024-11-16 12:38:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147260001] [2024-11-16 12:38:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:38:19,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:19,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147260001] [2024-11-16 12:38:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147260001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:38:19,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:38:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:38:19,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953102756] [2024-11-16 12:38:19,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:38:19,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:38:19,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:19,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:38:19,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:38:19,539 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:19,681 INFO L93 Difference]: Finished difference Result 417 states and 574 transitions. [2024-11-16 12:38:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:38:19,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-16 12:38:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:19,684 INFO L225 Difference]: With dead ends: 417 [2024-11-16 12:38:19,685 INFO L226 Difference]: Without dead ends: 297 [2024-11-16 12:38:19,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 12:38:19,687 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 86 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:19,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:38:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-16 12:38:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 292. [2024-11-16 12:38:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 180 states have (on average 1.1111111111111112) internal successors, (200), 180 states have internal predecessors, (200), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 12:38:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 400 transitions. [2024-11-16 12:38:19,715 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 400 transitions. Word has length 133 [2024-11-16 12:38:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:19,715 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 400 transitions. [2024-11-16 12:38:19,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 400 transitions. [2024-11-16 12:38:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:38:19,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:19,717 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:19,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:38:19,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:19,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:19,717 INFO L85 PathProgramCache]: Analyzing trace with hash 126913875, now seen corresponding path program 1 times [2024-11-16 12:38:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:19,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638582626] [2024-11-16 12:38:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 57 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2024-11-16 12:38:20,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638582626] [2024-11-16 12:38:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638582626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:38:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782242110] [2024-11-16 12:38:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:20,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:38:20,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:38:20,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:38:20,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:38:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:21,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-16 12:38:21,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:38:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 471 proven. 126 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2024-11-16 12:38:23,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:38:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782242110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:38:53,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:38:53,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 28 [2024-11-16 12:38:53,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366695314] [2024-11-16 12:38:53,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:38:53,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 12:38:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:53,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 12:38:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=1206, Unknown=2, NotChecked=0, Total=1640 [2024-11-16 12:38:53,552 INFO L87 Difference]: Start difference. First operand 292 states and 400 transitions. Second operand has 28 states, 28 states have (on average 3.0) internal successors, (84), 26 states have internal predecessors, (84), 10 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-11-16 12:38:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:56,959 INFO L93 Difference]: Finished difference Result 913 states and 1130 transitions. [2024-11-16 12:38:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-16 12:38:56,960 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 26 states have internal predecessors, (84), 10 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 133 [2024-11-16 12:38:56,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:56,962 INFO L225 Difference]: With dead ends: 913 [2024-11-16 12:38:56,963 INFO L226 Difference]: Without dead ends: 676 [2024-11-16 12:38:56,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4038 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=3188, Invalid=9920, Unknown=2, NotChecked=0, Total=13110 [2024-11-16 12:38:56,966 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 745 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:56,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 443 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 12:38:56,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2024-11-16 12:38:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 433. [2024-11-16 12:38:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 288 states have (on average 1.0868055555555556) internal successors, (313), 289 states have internal predecessors, (313), 102 states have call successors, (102), 42 states have call predecessors, (102), 42 states have return successors, (102), 101 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-16 12:38:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 517 transitions. [2024-11-16 12:38:57,043 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 517 transitions. Word has length 133 [2024-11-16 12:38:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:57,049 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 517 transitions. [2024-11-16 12:38:57,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 26 states have internal predecessors, (84), 10 states have call successors, (40), 7 states have call predecessors, (40), 10 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-11-16 12:38:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 517 transitions. [2024-11-16 12:38:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:38:57,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:57,050 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:57,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 12:38:57,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 12:38:57,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:57,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:57,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1441330762, now seen corresponding path program 1 times [2024-11-16 12:38:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630112704] [2024-11-16 12:38:57,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:57,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 12:38:57,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630112704] [2024-11-16 12:38:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630112704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:38:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692301442] [2024-11-16 12:38:57,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:57,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:38:57,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:38:57,482 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:38:57,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 12:38:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:57,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 12:38:57,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:38:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-11-16 12:38:57,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:38:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 12:38:58,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692301442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:38:58,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:38:58,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-16 12:38:58,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653129087] [2024-11-16 12:38:58,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:38:58,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 12:38:58,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 12:38:58,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:38:58,027 INFO L87 Difference]: Start difference. First operand 433 states and 517 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-16 12:38:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:58,497 INFO L93 Difference]: Finished difference Result 1037 states and 1219 transitions. [2024-11-16 12:38:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 12:38:58,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 133 [2024-11-16 12:38:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:58,502 INFO L225 Difference]: With dead ends: 1037 [2024-11-16 12:38:58,503 INFO L226 Difference]: Without dead ends: 682 [2024-11-16 12:38:58,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 300 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-16 12:38:58,507 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 112 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:58,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 366 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 12:38:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-11-16 12:38:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 431. [2024-11-16 12:38:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 285 states have (on average 1.0736842105263158) internal successors, (306), 285 states have internal predecessors, (306), 100 states have call successors, (100), 45 states have call predecessors, (100), 45 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 12:38:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 506 transitions. [2024-11-16 12:38:58,570 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 506 transitions. Word has length 133 [2024-11-16 12:38:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:58,573 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 506 transitions. [2024-11-16 12:38:58,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-16 12:38:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 506 transitions. [2024-11-16 12:38:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:38:58,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:58,575 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:58,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 12:38:58,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:38:58,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:58,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:58,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1412701611, now seen corresponding path program 1 times [2024-11-16 12:38:58,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:58,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143633795] [2024-11-16 12:38:58,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:58,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:38:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:38:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:38:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:38:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:38:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:38:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:38:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:38:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:38:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:38:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:38:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:38:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:38:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:38:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:38:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:38:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:38:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:38:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:38:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:38:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:38:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:38:58,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:38:58,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143633795] [2024-11-16 12:38:58,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143633795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:38:58,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:38:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:38:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971658764] [2024-11-16 12:38:58,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:38:58,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:38:58,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:38:58,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:38:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:38:58,931 INFO L87 Difference]: Start difference. First operand 431 states and 506 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:38:58,985 INFO L93 Difference]: Finished difference Result 708 states and 830 transitions. [2024-11-16 12:38:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:38:58,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-16 12:38:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:38:58,988 INFO L225 Difference]: With dead ends: 708 [2024-11-16 12:38:58,988 INFO L226 Difference]: Without dead ends: 347 [2024-11-16 12:38:58,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:38:58,990 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:38:58,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 152 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:38:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-16 12:38:59,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2024-11-16 12:38:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 225 states have (on average 1.0577777777777777) internal successors, (238), 225 states have internal predecessors, (238), 80 states have call successors, (80), 36 states have call predecessors, (80), 36 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-16 12:38:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 398 transitions. [2024-11-16 12:38:59,027 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 398 transitions. Word has length 133 [2024-11-16 12:38:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:38:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 398 transitions. [2024-11-16 12:38:59,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:38:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 398 transitions. [2024-11-16 12:38:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:38:59,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:38:59,030 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:59,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:38:59,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:38:59,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:38:59,031 INFO L85 PathProgramCache]: Analyzing trace with hash 341372945, now seen corresponding path program 1 times [2024-11-16 12:38:59,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:38:59,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020391604] [2024-11-16 12:38:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:59,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:38:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:38:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488786470] [2024-11-16 12:38:59,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:38:59,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:38:59,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:38:59,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:38:59,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 12:38:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:38:59,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:38:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:38:59,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:38:59,550 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:38:59,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:38:59,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 12:38:59,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:38:59,755 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:38:59,823 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:38:59,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:38:59 BoogieIcfgContainer [2024-11-16 12:38:59,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:38:59,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:38:59,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:38:59,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:38:59,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:38:10" (3/4) ... [2024-11-16 12:38:59,829 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:38:59,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:38:59,830 INFO L158 Benchmark]: Toolchain (without parser) took 49850.79ms. Allocated memory was 159.4MB in the beginning and 539.0MB in the end (delta: 379.6MB). Free memory was 85.4MB in the beginning and 461.5MB in the end (delta: -376.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-16 12:38:59,830 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:38:59,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.50ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 69.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:38:59,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.37ms. Allocated memory is still 159.4MB. Free memory was 69.7MB in the beginning and 66.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:38:59,834 INFO L158 Benchmark]: Boogie Preprocessor took 48.19ms. Allocated memory is still 159.4MB. Free memory was 66.7MB in the beginning and 62.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:38:59,834 INFO L158 Benchmark]: IcfgBuilder took 571.65ms. Allocated memory was 159.4MB in the beginning and 257.9MB in the end (delta: 98.6MB). Free memory was 62.7MB in the beginning and 212.1MB in the end (delta: -149.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-11-16 12:38:59,835 INFO L158 Benchmark]: TraceAbstraction took 48877.19ms. Allocated memory was 257.9MB in the beginning and 539.0MB in the end (delta: 281.0MB). Free memory was 211.0MB in the beginning and 461.5MB in the end (delta: -250.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 12:38:59,835 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 539.0MB. Free memory is still 461.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:38:59,836 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.16ms. Allocated memory is still 159.4MB. Free memory is still 110.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.50ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 69.7MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.37ms. Allocated memory is still 159.4MB. Free memory was 69.7MB in the beginning and 66.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.19ms. Allocated memory is still 159.4MB. Free memory was 66.7MB in the beginning and 62.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 571.65ms. Allocated memory was 159.4MB in the beginning and 257.9MB in the end (delta: 98.6MB). Free memory was 62.7MB in the beginning and 212.1MB in the end (delta: -149.4MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 48877.19ms. Allocated memory was 257.9MB in the beginning and 539.0MB in the end (delta: 281.0MB). Free memory was 211.0MB in the beginning and 461.5MB in the end (delta: -250.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 539.0MB. Free memory is still 461.5MB. 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 131, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] unsigned short int last_1_var_1_6 = 4; [L40] unsigned short int last_1_var_1_9 = 4; [L41] unsigned long int last_1_var_1_14 = 500; [L42] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_6 = var_1_6 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_14 = var_1_14 [L128] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L111] var_1_19 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] var_1_20 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] var_1_21 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET updateVariables() [L140] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L47] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L52] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L53] COND TRUE last_1_var_1_14 >= stepLocal_3 [L54] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L56] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L57] COND TRUE (- var_1_14) > var_1_6 [L58] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] unsigned char stepLocal_2 = var_1_4; [L64] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L65] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND TRUE stepLocal_1 >= var_1_6 [L69] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L74] unsigned char stepLocal_5 = var_1_1; [L75] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L76] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L83] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L84] COND TRUE ! var_1_1 [L85] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.7s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1408 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1404 mSDsluCounter, 2334 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1545 mSDsCounter, 525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1727 IncrementalHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 525 mSolverCounterUnsat, 789 mSDtfsCounter, 1727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1272 GetRequests, 1100 SyntacticMatches, 4 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4141 ImplicationChecksByTransitivity, 31.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433occurred in iteration=6, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 657 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 1727 NumberOfCodeBlocks, 1727 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1712 ConstructedInterpolants, 0 QuantifiedInterpolants, 10363 SizeOfPredicates, 13 NumberOfNonLiveVariables, 945 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 9391/9880 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 12:38:59,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodesize_normal_file-4.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 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:39:01,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:39:01,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:39:01,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:39:01,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:39:01,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:39:01,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:39:01,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:39:01,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:39:01,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:39:01,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:39:01,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:39:01,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:39:01,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:39:01,969 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:39:01,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:39:01,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:39:01,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:39:01,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:39:01,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:39:01,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:39:01,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:39:01,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:39:01,972 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:39:01,972 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:39:01,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:39:01,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:39:01,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:39:01,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:39:01,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:39:01,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:39:01,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:39:01,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:39:01,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:39:01,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:39:01,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:39:01,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:39:01,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:39:01,976 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:39:01,976 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:39:01,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:39:01,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:39:01,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:39:01,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:39:01,977 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2024-11-16 12:39:02,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:39:02,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:39:02,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:39:02,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:39:02,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:39:02,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-11-16 12:39:03,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:39:03,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:39:03,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2024-11-16 12:39:03,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46ec47ee/37485645ee6144d994966d0f3c8e750d/FLAGe0627fd76 [2024-11-16 12:39:03,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46ec47ee/37485645ee6144d994966d0f3c8e750d [2024-11-16 12:39:03,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:39:03,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:39:03,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:39:03,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:39:03,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:39:03,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:03" (1/1) ... [2024-11-16 12:39:03,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ed32f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:03, skipping insertion in model container [2024-11-16 12:39:03,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:03" (1/1) ... [2024-11-16 12:39:03,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:39:04,016 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-11-16 12:39:04,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:39:04,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:39:04,115 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_fillercode_fillercodesize_normal_file-4.i[912,925] [2024-11-16 12:39:04,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:39:04,165 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:39:04,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04 WrapperNode [2024-11-16 12:39:04,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:39:04,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:39:04,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:39:04,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:39:04,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,213 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-16 12:39:04,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:39:04,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:39:04,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:39:04,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:39:04,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,239 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 12:39:04,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,246 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:39:04,252 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:39:04,252 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:39:04,252 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:39:04,253 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (1/1) ... [2024-11-16 12:39:04,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:39:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:39:04,280 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 12:39:04,282 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 12:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:39:04,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:39:04,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:39:04,406 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:39:04,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:39:04,921 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 12:39:04,921 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:39:04,932 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:39:04,932 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:39:04,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:39:04 BoogieIcfgContainer [2024-11-16 12:39:04,932 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:39:04,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:39:04,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:39:04,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:39:04,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:39:03" (1/3) ... [2024-11-16 12:39:04,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163903f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:04, skipping insertion in model container [2024-11-16 12:39:04,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:04" (2/3) ... [2024-11-16 12:39:04,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@163903f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:04, skipping insertion in model container [2024-11-16 12:39:04,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:39:04" (3/3) ... [2024-11-16 12:39:04,938 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-4.i [2024-11-16 12:39:04,950 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:39:04,951 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:39:05,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:39:05,009 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;@2005b1e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:39:05,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:39:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:39:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 12:39:05,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:39:05,032 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:39:05,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:39:05,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:39:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash -52729866, now seen corresponding path program 1 times [2024-11-16 12:39:05,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:39:05,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512288018] [2024-11-16 12:39:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:39:05,053 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 12:39:05,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:39:05,058 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 12:39:05,073 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 12:39:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:39:05,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:39:05,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:39:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-16 12:39:05,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:39:05,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:39:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512288018] [2024-11-16 12:39:05,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512288018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:39:05,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:39:05,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:39:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122723326] [2024-11-16 12:39:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:39:05,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:39:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:39:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:39:05,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:39:05,387 INFO L87 Difference]: Start difference. First operand has 67 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:39:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:39:05,410 INFO L93 Difference]: Finished difference Result 126 states and 213 transitions. [2024-11-16 12:39:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:39:05,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2024-11-16 12:39:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:39:05,417 INFO L225 Difference]: With dead ends: 126 [2024-11-16 12:39:05,418 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 12:39:05,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 12:39:05,424 INFO L432 NwaCegarLoop]: 91 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, 91 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 12:39:05,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:39:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 12:39:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 12:39:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:39:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-16 12:39:05,462 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 131 [2024-11-16 12:39:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:39:05,463 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-16 12:39:05,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 12:39:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-16 12:39:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 12:39:05,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:39:05,466 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:39:05,476 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 12:39:05,668 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 12:39:05,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:39:05,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:39:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 913394995, now seen corresponding path program 1 times [2024-11-16 12:39:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:39:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139798476] [2024-11-16 12:39:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:39:05,671 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 12:39:05,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:39:05,673 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 12:39:05,674 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 12:39:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:39:05,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 12:39:05,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:39:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2024-11-16 12:39:06,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:39:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-16 12:39:06,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:39:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139798476] [2024-11-16 12:39:06,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139798476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:39:06,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:39:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-16 12:39:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593630107] [2024-11-16 12:39:06,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:39:06,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 12:39:06,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:39:06,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 12:39:06,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:39:06,940 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-16 12:39:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:39:08,103 INFO L93 Difference]: Finished difference Result 149 states and 206 transitions. [2024-11-16 12:39:08,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 12:39:08,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 132 [2024-11-16 12:39:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:39:08,106 INFO L225 Difference]: With dead ends: 149 [2024-11-16 12:39:08,106 INFO L226 Difference]: Without dead ends: 90 [2024-11-16 12:39:08,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 249 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-16 12:39:08,108 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:39:08,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 207 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 12:39:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-16 12:39:08,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-11-16 12:39:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 12:39:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-11-16 12:39:08,120 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 132 [2024-11-16 12:39:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:39:08,121 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-11-16 12:39:08,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 14 states have internal predecessors, (53), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-16 12:39:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2024-11-16 12:39:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:39:08,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:39:08,123 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:39:08,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 12:39:08,327 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 12:39:08,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:39:08,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:39:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 323427380, now seen corresponding path program 1 times [2024-11-16 12:39:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:39:08,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959505285] [2024-11-16 12:39:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:39:08,329 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 12:39:08,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:39:08,331 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 12:39:08,333 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 12:39:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:39:08,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 12:39:08,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:39:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:39:08,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:39:08,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:39:08,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959505285] [2024-11-16 12:39:08,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959505285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:39:08,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:39:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:39:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863737859] [2024-11-16 12:39:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:39:08,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:39:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:39:08,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:39:08,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:39:08,795 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:39:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:39:09,314 INFO L93 Difference]: Finished difference Result 209 states and 275 transitions. [2024-11-16 12:39:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:39:09,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-16 12:39:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:39:09,316 INFO L225 Difference]: With dead ends: 209 [2024-11-16 12:39:09,316 INFO L226 Difference]: Without dead ends: 138 [2024-11-16 12:39:09,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:39:09,318 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 95 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:39:09,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 220 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:39:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-16 12:39:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2024-11-16 12:39:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 88 states have internal predecessors, (97), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 12:39:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2024-11-16 12:39:09,353 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 133 [2024-11-16 12:39:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:39:09,353 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2024-11-16 12:39:09,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:39:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2024-11-16 12:39:09,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:39:09,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:39:09,355 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:39:09,365 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 (4)] Forceful destruction successful, exit code 0 [2024-11-16 12:39:09,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 12:39:09,562 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:39:09,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:39:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 126913875, now seen corresponding path program 1 times [2024-11-16 12:39:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:39:09,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602124157] [2024-11-16 12:39:09,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:39:09,563 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 12:39:09,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:39:09,565 INFO L229 MonitoredProcess]: Starting monitored process 5 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 12:39:09,566 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 (5)] Waiting until timeout for monitored process [2024-11-16 12:39:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:39:09,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 12:39:09,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:39:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-16 12:39:10,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:39:10,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:39:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602124157] [2024-11-16 12:39:10,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602124157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:39:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [851052089] [2024-11-16 12:39:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:39:10,435 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 12:39:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 12:39:10,437 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 12:39:10,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-16 12:39:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:39:10,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 12:39:10,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:39:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-16 12:39:11,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:39:11,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [851052089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:39:11,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:39:11,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-16 12:39:11,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738811512] [2024-11-16 12:39:11,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:39:11,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 12:39:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:39:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 12:39:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-16 12:39:11,799 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-11-16 12:39:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:39:14,593 INFO L93 Difference]: Finished difference Result 374 states and 473 transitions. [2024-11-16 12:39:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 12:39:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 133 [2024-11-16 12:39:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:39:14,601 INFO L225 Difference]: With dead ends: 374 [2024-11-16 12:39:14,602 INFO L226 Difference]: Without dead ends: 242 [2024-11-16 12:39:14,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-16 12:39:14,610 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 311 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 12:39:14,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 317 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 12:39:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-16 12:39:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 221. [2024-11-16 12:39:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 145 states have (on average 1.0827586206896551) internal successors, (157), 145 states have internal predecessors, (157), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 12:39:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 277 transitions. [2024-11-16 12:39:14,683 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 277 transitions. Word has length 133 [2024-11-16 12:39:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:39:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 277 transitions. [2024-11-16 12:39:14,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2024-11-16 12:39:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 277 transitions. [2024-11-16 12:39:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 12:39:14,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:39:14,693 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:39:14,706 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 (5)] Forceful destruction successful, exit code 0 [2024-11-16 12:39:14,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-16 12:39:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 12:39:15,098 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:39:15,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:39:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash -378644750, now seen corresponding path program 1 times [2024-11-16 12:39:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:39:15,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566982347] [2024-11-16 12:39:15,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:39:15,099 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 12:39:15,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:39:15,104 INFO L229 MonitoredProcess]: Starting monitored process 7 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 12:39:15,105 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 (7)] Waiting until timeout for monitored process [2024-11-16 12:39:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:39:15,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 12:39:15,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:39:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 12:39:15,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:39:15,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:39:15,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566982347] [2024-11-16 12:39:15,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566982347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:39:15,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:39:15,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:39:15,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297915893] [2024-11-16 12:39:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:39:15,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:39:15,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:39:15,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:39:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:39:15,673 INFO L87 Difference]: Start difference. First operand 221 states and 277 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:39:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:39:16,363 INFO L93 Difference]: Finished difference Result 369 states and 459 transitions. [2024-11-16 12:39:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:39:16,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-16 12:39:16,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:39:16,376 INFO L225 Difference]: With dead ends: 369 [2024-11-16 12:39:16,376 INFO L226 Difference]: Without dead ends: 151 [2024-11-16 12:39:16,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:39:16,377 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:39:16,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 251 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:39:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-16 12:39:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2024-11-16 12:39:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 12:39:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 165 transitions. [2024-11-16 12:39:16,397 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 165 transitions. Word has length 133 [2024-11-16 12:39:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:39:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 165 transitions. [2024-11-16 12:39:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 12:39:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2024-11-16 12:39:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 12:39:16,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:39:16,398 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:39:16,406 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 (7)] Ended with exit code 0 [2024-11-16 12:39:16,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 12:39:16,599 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:39:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:39:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash 341372945, now seen corresponding path program 1 times [2024-11-16 12:39:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:39:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128512783] [2024-11-16 12:39:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:39:16,601 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 12:39:16,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:39:16,604 INFO L229 MonitoredProcess]: Starting monitored process 8 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 12:39:16,604 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 (8)] Waiting until timeout for monitored process [2024-11-16 12:39:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:39:16,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 12:39:16,755 INFO L278 TraceCheckSpWp]: Computing forward predicates...