/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-52.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:37:40,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:37:40,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 23:37:40,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:37:40,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:37:40,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:37:40,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:37:40,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:37:40,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:37:40,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:37:40,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:37:40,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:37:40,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:37:40,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:37:40,379 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:37:40,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:37:40,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:37:40,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:37:40,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:37:40,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:37:40,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:37:40,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:37:40,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:37:40,383 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:37:40,383 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:37:40,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:37:40,384 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:37:40,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:37:40,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:37:40,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:37:40,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:37:40,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:37:40,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:37:40,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:37:40,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:37:40,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:37:40,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:37:40,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:37:40,386 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:37:40,386 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:37:40,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:37:40,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:37:40,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:37:40,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:37:40,388 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/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: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 23:37:40,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:37:40,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:37:40,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:37:40,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:37:40,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:37:40,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2024-11-05 23:37:42,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:37:42,356 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:37:42,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-52.i [2024-11-05 23:37:42,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaec9a57c/7b43a5a4853f42a2bf910ba040791492/FLAGb5bca5ae1 [2024-11-05 23:37:42,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaec9a57c/7b43a5a4853f42a2bf910ba040791492 [2024-11-05 23:37:42,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:37:42,382 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:37:42,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:37:42,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:37:42,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:37:42,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf2bd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42, skipping insertion in model container [2024-11-05 23:37:42,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:37:42,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-52.i[915,928] [2024-11-05 23:37:42,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:37:42,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:37:42,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-52.i[915,928] [2024-11-05 23:37:42,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:37:42,714 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:37:42,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42 WrapperNode [2024-11-05 23:37:42,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:37:42,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:37:42,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:37:42,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:37:42,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,764 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-05 23:37:42,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:37:42,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:37:42,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:37:42,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:37:42,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,793 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-05 23:37:42,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:37:42,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:37:42,815 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:37:42,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:37:42,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (1/1) ... [2024-11-05 23:37:42,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:37:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:37:42,858 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-05 23:37:42,869 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-05 23:37:42,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:37:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:37:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:37:42,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:37:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:37:42,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:37:42,986 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:37:42,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:37:43,297 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-05 23:37:43,298 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:37:43,314 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:37:43,314 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:37:43,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:37:43 BoogieIcfgContainer [2024-11-05 23:37:43,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:37:43,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:37:43,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:37:43,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:37:43,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:37:42" (1/3) ... [2024-11-05 23:37:43,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64076974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:37:43, skipping insertion in model container [2024-11-05 23:37:43,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:37:42" (2/3) ... [2024-11-05 23:37:43,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64076974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:37:43, skipping insertion in model container [2024-11-05 23:37:43,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:37:43" (3/3) ... [2024-11-05 23:37:43,330 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-52.i [2024-11-05 23:37:43,347 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:37:43,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:37:43,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:37:43,431 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ab96b21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:37:43,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:37:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 23:37:43,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-05 23:37:43,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:37:43,452 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:37:43,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:37:43,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:37:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1915705130, now seen corresponding path program 1 times [2024-11-05 23:37:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:37:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907545765] [2024-11-05 23:37:43,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:37:43,477 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-05 23:37:43,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:37:43,480 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-05 23:37:43,483 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-05 23:37:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:37:43,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 23:37:43,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:37:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-05 23:37:44,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:37:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-05 23:37:44,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:37:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907545765] [2024-11-05 23:37:44,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907545765] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 23:37:44,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:37:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-05 23:37:44,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557136670] [2024-11-05 23:37:44,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:37:44,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 23:37:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:37:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 23:37:44,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-05 23:37:44,655 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-05 23:37:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:37:45,936 INFO L93 Difference]: Finished difference Result 207 states and 359 transitions. [2024-11-05 23:37:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-05 23:37:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) Word has length 113 [2024-11-05 23:37:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:37:45,947 INFO L225 Difference]: With dead ends: 207 [2024-11-05 23:37:45,947 INFO L226 Difference]: Without dead ends: 158 [2024-11-05 23:37:45,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2024-11-05 23:37:45,954 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 220 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 23:37:45,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 267 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-05 23:37:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-05 23:37:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 59. [2024-11-05 23:37:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 23:37:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-11-05 23:37:46,011 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 113 [2024-11-05 23:37:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:37:46,012 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-11-05 23:37:46,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 4 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-05 23:37:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-11-05 23:37:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-05 23:37:46,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:37:46,017 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:37:46,025 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-05 23:37:46,221 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-05 23:37:46,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:37:46,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:37:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1106358504, now seen corresponding path program 1 times [2024-11-05 23:37:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:37:46,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323720977] [2024-11-05 23:37:46,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:37:46,227 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-05 23:37:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:37:46,231 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-05 23:37:46,233 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-05 23:37:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:37:46,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 23:37:46,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:37:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-05 23:37:56,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:37:56,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:37:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323720977] [2024-11-05 23:37:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323720977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:37:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:37:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-05 23:37:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205254554] [2024-11-05 23:37:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:37:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 23:37:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:37:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 23:37:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:37:56,565 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-05 23:37:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:37:57,039 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2024-11-05 23:37:57,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 23:37:57,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-05 23:37:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:37:57,044 INFO L225 Difference]: With dead ends: 87 [2024-11-05 23:37:57,044 INFO L226 Difference]: Without dead ends: 85 [2024-11-05 23:37:57,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-05 23:37:57,046 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 36 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 23:37:57,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 277 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 23:37:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-05 23:37:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2024-11-05 23:37:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 23:37:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 85 transitions. [2024-11-05 23:37:57,063 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 85 transitions. Word has length 113 [2024-11-05 23:37:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:37:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 85 transitions. [2024-11-05 23:37:57,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-05 23:37:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 85 transitions. [2024-11-05 23:37:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-05 23:37:57,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:37:57,066 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:37:57,074 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-05 23:37:57,269 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-05 23:37:57,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:37:57,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:37:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash 668648858, now seen corresponding path program 1 times [2024-11-05 23:37:57,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:37:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210149621] [2024-11-05 23:37:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:37:57,272 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-05 23:37:57,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:37:57,276 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-05 23:37:57,277 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-05 23:37:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:37:57,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 23:37:57,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:38:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-05 23:38:04,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:38:04,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:38:04,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210149621] [2024-11-05 23:38:04,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210149621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:38:04,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:38:04,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-05 23:38:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219546455] [2024-11-05 23:38:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:38:04,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 23:38:04,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:38:04,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 23:38:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-05 23:38:04,624 INFO L87 Difference]: Start difference. First operand 64 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-05 23:38:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:38:05,130 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2024-11-05 23:38:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 23:38:05,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-05 23:38:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:38:05,137 INFO L225 Difference]: With dead ends: 90 [2024-11-05 23:38:05,137 INFO L226 Difference]: Without dead ends: 88 [2024-11-05 23:38:05,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-05 23:38:05,138 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 33 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 23:38:05,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 331 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 23:38:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-05 23:38:05,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2024-11-05 23:38:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 23:38:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-11-05 23:38:05,158 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 113 [2024-11-05 23:38:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:38:05,158 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-11-05 23:38:05,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-05 23:38:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-11-05 23:38:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-05 23:38:05,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:38:05,160 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:38:05,165 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-05 23:38:05,363 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-05 23:38:05,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:38:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:38:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 508969851, now seen corresponding path program 1 times [2024-11-05 23:38:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:38:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176140769] [2024-11-05 23:38:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:38:05,366 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-05 23:38:05,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:38:05,367 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-05 23:38:05,368 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-05 23:38:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:38:05,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 23:38:05,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:38:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-05 23:38:12,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:38:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-05 23:38:34,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:38:34,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176140769] [2024-11-05 23:38:34,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176140769] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 23:38:34,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 23:38:34,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2024-11-05 23:38:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055994354] [2024-11-05 23:38:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:38:34,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 23:38:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:38:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 23:38:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-05 23:38:34,662 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-05 23:38:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:38:45,924 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2024-11-05 23:38:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 23:38:45,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-05 23:38:45,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:38:45,930 INFO L225 Difference]: With dead ends: 95 [2024-11-05 23:38:45,930 INFO L226 Difference]: Without dead ends: 93 [2024-11-05 23:38:45,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2024-11-05 23:38:45,931 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 33 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-05 23:38:45,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 315 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-05 23:38:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-05 23:38:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2024-11-05 23:38:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-05 23:38:45,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-11-05 23:38:45,943 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 114 [2024-11-05 23:38:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:38:45,944 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-11-05 23:38:45,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-05 23:38:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-11-05 23:38:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-05 23:38:45,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:38:45,946 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 23:38:45,951 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-05 23:38:46,146 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 [2024-11-05 23:38:46,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:38:46,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:38:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash 507122809, now seen corresponding path program 1 times [2024-11-05 23:38:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:38:46,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769673409] [2024-11-05 23:38:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:38:46,148 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-05 23:38:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:38:46,150 INFO L229 MonitoredProcess]: Starting monitored process 6 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-05 23:38:46,152 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 (6)] Waiting until timeout for monitored process [2024-11-05 23:38:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:38:46,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 23:38:46,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:38:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 326 proven. 36 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-05 23:38:57,212 INFO L311 TraceCheckSpWp]: Computing backward predicates...