./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-5.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 bf6971d57e8e3c4eaa779ba7638c69c09b078f6ad29e154ec059bb718f2c53ac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:27:29,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:27:29,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:27:29,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:27:29,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:27:29,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:27:29,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:27:29,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:27:29,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:27:29,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:27:29,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:27:29,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:27:29,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:27:29,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:27:29,838 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:27:29,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:27:29,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:27:29,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:27:29,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:27:29,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:27:29,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:27:29,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:27:29,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:27:29,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:27:29,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:27:29,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:27:29,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:27:29,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:27:29,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:27:29,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:27:29,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:27:29,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:27:29,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:29,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:27:29,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:27:29,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:27:29,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:27:29,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:27:29,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:27:29,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:27:29,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:27:29,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:27:29,848 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 -> bf6971d57e8e3c4eaa779ba7638c69c09b078f6ad29e154ec059bb718f2c53ac [2024-11-20 07:27:30,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:27:30,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:27:30,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:27:30,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:27:30,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:27:30,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-5.i [2024-11-20 07:27:31,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:27:31,885 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:27:31,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-5.i [2024-11-20 07:27:31,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc662345/195ecb18dd9342be8047f263af61e5df/FLAG9137ee8a9 [2024-11-20 07:27:31,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc662345/195ecb18dd9342be8047f263af61e5df [2024-11-20 07:27:31,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:27:31,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:27:31,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:31,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:27:31,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:27:31,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:31" (1/1) ... [2024-11-20 07:27:31,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d58e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:31, skipping insertion in model container [2024-11-20 07:27:31,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:27:31" (1/1) ... [2024-11-20 07:27:31,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:27:32,126 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_operatoramount_amount10_file-5.i[914,927] [2024-11-20 07:27:32,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:32,161 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:27:32,171 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_operatoramount_amount10_file-5.i[914,927] [2024-11-20 07:27:32,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:27:32,202 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:27:32,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32 WrapperNode [2024-11-20 07:27:32,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:27:32,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:32,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:27:32,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:27:32,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,236 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 60 [2024-11-20 07:27:32,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:27:32,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:27:32,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:27:32,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:27:32,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,273 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-20 07:27:32,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:27:32,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:27:32,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:27:32,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:27:32,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (1/1) ... [2024-11-20 07:27:32,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:27:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:27:32,327 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-20 07:27:32,331 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-20 07:27:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:27:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:27:32,386 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:27:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:27:32,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:27:32,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:27:32,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:27:32,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:27:32,669 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 07:27:32,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:27:32,712 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:27:32,712 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:27:32,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:32 BoogieIcfgContainer [2024-11-20 07:27:32,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:27:32,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:27:32,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:27:32,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:27:32,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:27:31" (1/3) ... [2024-11-20 07:27:32,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cd85bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:32, skipping insertion in model container [2024-11-20 07:27:32,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:27:32" (2/3) ... [2024-11-20 07:27:32,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cd85bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:27:32, skipping insertion in model container [2024-11-20 07:27:32,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:32" (3/3) ... [2024-11-20 07:27:32,735 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-5.i [2024-11-20 07:27:32,803 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:27:32,807 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:27:32,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:27:32,888 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;@6bcf0388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:27:32,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:27:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 07:27:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 07:27:32,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:32,906 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 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-20 07:27:32,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:32,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2003837583, now seen corresponding path program 1 times [2024-11-20 07:27:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128477684] [2024-11-20 07:27:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:27:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:27:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:27:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:27:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:27:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 07:27:33,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:33,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128477684] [2024-11-20 07:27:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128477684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:33,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:33,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:27:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066332011] [2024-11-20 07:27:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:33,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:27:33,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:27:33,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:27:33,174 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 07:27:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:33,192 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2024-11-20 07:27:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:27:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2024-11-20 07:27:33,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:33,199 INFO L225 Difference]: With dead ends: 53 [2024-11-20 07:27:33,199 INFO L226 Difference]: Without dead ends: 26 [2024-11-20 07:27:33,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-20 07:27:33,205 INFO L432 NwaCegarLoop]: 33 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, 33 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-20 07:27:33,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:27:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-20 07:27:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-20 07:27:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 07:27:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-20 07:27:33,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 43 [2024-11-20 07:27:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:33,236 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-20 07:27:33,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-20 07:27:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-20 07:27:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 07:27:33,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:33,239 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 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-20 07:27:33,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:27:33,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1590204081, now seen corresponding path program 1 times [2024-11-20 07:27:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951319864] [2024-11-20 07:27:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:33,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:27:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:27:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:27:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:27:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:27:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 07:27:33,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951319864] [2024-11-20 07:27:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951319864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:33,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:33,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:27:33,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963684576] [2024-11-20 07:27:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:33,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:27:33,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:27:33,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:27:33,815 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 07:27:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:33,970 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-20 07:27:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:27:33,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2024-11-20 07:27:33,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:33,973 INFO L225 Difference]: With dead ends: 34 [2024-11-20 07:27:33,973 INFO L226 Difference]: Without dead ends: 32 [2024-11-20 07:27:33,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:27:33,976 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 07:27:33,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 138 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 07:27:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-20 07:27:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-20 07:27:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 07:27:33,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-20 07:27:33,985 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 43 [2024-11-20 07:27:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:33,990 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-20 07:27:33,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 07:27:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-20 07:27:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-20 07:27:33,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:27:33,994 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 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-20 07:27:33,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:27:33,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:27:33,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:27:33,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2105187990, now seen corresponding path program 1 times [2024-11-20 07:27:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:27:33,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397951066] [2024-11-20 07:27:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:27:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:27:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:27:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:27:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:27:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:27:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:27:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:27:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:27:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-20 07:27:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:27:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397951066] [2024-11-20 07:27:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397951066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:27:34,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:27:34,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 07:27:34,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156413213] [2024-11-20 07:27:34,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:27:34,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 07:27:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:27:34,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 07:27:34,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 07:27:34,311 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 07:27:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:27:34,393 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-11-20 07:27:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 07:27:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 44 [2024-11-20 07:27:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:27:34,396 INFO L225 Difference]: With dead ends: 58 [2024-11-20 07:27:34,396 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 07:27:34,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:27:34,397 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:27:34,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 131 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:27:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 07:27:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 07:27:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 07:27:34,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 07:27:34,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-11-20 07:27:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:27:34,404 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 07:27:34,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-20 07:27:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 07:27:34,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 07:27:34,409 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:27:34,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:27:34,413 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 07:27:34,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 07:27:34,435 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:27:34,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:27:34 BoogieIcfgContainer [2024-11-20 07:27:34,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:27:34,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:27:34,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:27:34,462 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:27:34,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:27:32" (3/4) ... [2024-11-20 07:27:34,465 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 07:27:34,469 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 07:27:34,474 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-20 07:27:34,475 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 07:27:34,475 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 07:27:34,475 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 07:27:34,571 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 07:27:34,571 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 07:27:34,571 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:27:34,572 INFO L158 Benchmark]: Toolchain (without parser) took 2657.45ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 93.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,572 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:27:34,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.21ms. Allocated memory is still 148.9MB. Free memory was 112.0MB in the beginning and 99.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.84ms. Allocated memory is still 148.9MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,573 INFO L158 Benchmark]: Boogie Preprocessor took 46.33ms. Allocated memory is still 148.9MB. Free memory was 97.3MB in the beginning and 96.3MB in the end (delta: 976.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:27:34,573 INFO L158 Benchmark]: RCFGBuilder took 428.29ms. Allocated memory is still 148.9MB. Free memory was 96.2MB in the beginning and 119.9MB in the end (delta: -23.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,573 INFO L158 Benchmark]: TraceAbstraction took 1737.33ms. Allocated memory is still 148.9MB. Free memory was 119.2MB in the beginning and 97.8MB in the end (delta: 21.4MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,574 INFO L158 Benchmark]: Witness Printer took 110.69ms. Allocated memory is still 148.9MB. Free memory was 97.8MB in the beginning and 93.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:27:34,579 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 80.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.21ms. Allocated memory is still 148.9MB. Free memory was 112.0MB in the beginning and 99.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.84ms. Allocated memory is still 148.9MB. Free memory was 99.4MB in the beginning and 97.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.33ms. Allocated memory is still 148.9MB. Free memory was 97.3MB in the beginning and 96.3MB in the end (delta: 976.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 428.29ms. Allocated memory is still 148.9MB. Free memory was 96.2MB in the beginning and 119.9MB in the end (delta: -23.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1737.33ms. Allocated memory is still 148.9MB. Free memory was 119.2MB in the beginning and 97.8MB in the end (delta: 21.4MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 110.69ms. Allocated memory is still 148.9MB. Free memory was 97.8MB in the beginning and 93.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 302 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 95 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 180/180 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) RESULT: Ultimate proved your program to be correct! [2024-11-20 07:27:34,605 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 Writing output log to file Ultimate.log Result: TRUE